000 03410nam a22005055i 4500
001 978-3-319-09039-9
003 DE-He213
005 20200421112046.0
007 cr nn 008mamaa
008 141115s2015 gw | s |||| 0|eng d
020 _a9783319090399
_9978-3-319-09039-9
024 7 _a10.1007/978-3-319-09039-9
_2doi
050 4 _aQA76.9.M35
072 7 _aGPFC
_2bicssc
072 7 _aTEC000000
_2bisacsh
082 0 4 _a620
_223
245 1 0 _aAutomata, Universality, Computation
_h[electronic resource] :
_bTribute to Maurice Margenstern /
_cedited by Andrew Adamatzky.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2015.
300 _aXII, 418 p. 107 illus., 24 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aEmergence, Complexity and Computation,
_x2194-7287 ;
_v12
505 0 _aThe 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 _aThis 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 _aEngineering.
650 0 _aComputer science
_xMathematics.
650 0 _aComputer mathematics.
650 0 _aPhysics.
650 0 _aComplexity, Computational.
650 1 4 _aEngineering.
650 2 4 _aComplexity.
650 2 4 _aComplex Networks.
650 2 4 _aMathematical Applications in Computer Science.
700 1 _aAdamatzky, Andrew.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783319090382
830 0 _aEmergence, Complexity and Computation,
_x2194-7287 ;
_v12
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-319-09039-9
912 _aZDB-2-ENG
942 _cEBK
999 _c56926
_d56926