Automata, Universality, Computation (Record no. 56926)

000 -LEADER
fixed length control field 03410nam a22005055i 4500
001 - CONTROL NUMBER
control field 978-3-319-09039-9
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20200421112046.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 141115s2015 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783319090399
-- 978-3-319-09039-9
082 04 - CLASSIFICATION NUMBER
Call Number 620
245 10 - TITLE STATEMENT
Title Automata, Universality, Computation
Sub Title Tribute to Maurice Margenstern /
300 ## - PHYSICAL DESCRIPTION
Number of Pages XII, 418 p. 107 illus., 24 illus. in color.
490 1# - SERIES STATEMENT
Series statement Emergence, Complexity and Computation,
505 0# - FORMATTED CONTENTS NOTE
Remark 2 The common structure of the curves having a same Gauss word -- Logical theory of the additive monoid of subsets of natural integers -- Some reflections on mathematics and its relation to computer Science -- Sampling a Two-way Finite Automaton -- Constructing reversible Turing machines by reversible logic element with memory -- The Grossone methodology perspective on Turing machines -- On Parallel Array P Systems -- Computational models based on splicing -- Linear Cellular Automata and Decidability -- Algorithms with Active Cells Modeled by Cellular Automata with Write-Access (CA-w) -- Broadcasting automata and patterns on Z2 -- Real-Time Prime Generators Implemented on Small-State Cellular Automata -- Phyllosilicate Automata.
520 ## - SUMMARY, ETC.
Summary, etc This book is an intellectually stimulating excursion into mathematical machines and structures capable for a universal computation. World top experts in computer science and mathematics overview exciting and intriguing topics of logical theory of monoids, geometry of Gauss word, philosophy of mathematics in computer science, asynchronous and parallel P-systems, decidability in cellular automata, splicing systems, reversible Turing machines, information flows in two-way finite automata, prime generators in automaton arrays, Grossone and Turing machines, automaton models of atomic lattices. The book is  full of visually attractive examples of mathematical machines, open problems and challenges for future research. Those interested in the advancement of a theory of computation, philosophy of mathematics, future and emergent computing paradigms, architectures and implementations will find the book vital for their research and development.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
General subdivision Mathematics.
700 1# - AUTHOR 2
Author 2 Adamatzky, Andrew.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/978-3-319-09039-9
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks
264 #1 -
-- Cham :
-- Springer International Publishing :
-- Imprint: Springer,
-- 2015.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Engineering.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer science
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer mathematics.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Physics.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Complexity, Computational.
650 14 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Engineering.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Complexity.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Complex Networks.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Mathematical Applications in Computer Science.
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 2194-7287 ;
912 ## -
-- ZDB-2-ENG

No items available.