Automata, Universality, Computation Tribute to Maurice Margenstern

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 mathem...

Full description

Bibliographic Details
Other Authors: Adamatzky, Andrew (Editor)
Format: eBook
Language:English
Published: Cham Springer International Publishing 2015, 2015
Edition:1st ed. 2015
Series:Emergence, Complexity and Computation
Subjects:
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
LEADER 02858nmm a2200337 u 4500
001 EB000901321
003 EBX01000000000000000697892
005 00000000000000.0
007 cr|||||||||||||||||||||
008 141202 ||| eng
020 |a 9783319090399 
100 1 |a Adamatzky, Andrew  |e [editor] 
245 0 0 |a Automata, Universality, Computation  |h Elektronische Ressource  |b Tribute to Maurice Margenstern  |c edited by Andrew Adamatzky 
250 |a 1st ed. 2015 
260 |a Cham  |b Springer International Publishing  |c 2015, 2015 
300 |a XII, 418 p. 107 illus., 24 illus. in color  |b online resource 
505 0 |a 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 
653 |a Computer science / Mathematics 
653 |a Applied Dynamical Systems 
653 |a Mathematical Applications in Computer Science 
653 |a Graph Theory 
653 |a Nonlinear theories 
653 |a Graph theory 
653 |a Dynamics 
041 0 7 |a eng  |2 ISO 639-2 
989 |b Springer  |a Springer eBooks 2005- 
490 0 |a Emergence, Complexity and Computation 
028 5 0 |a 10.1007/978-3-319-09039-9 
856 4 0 |u https://doi.org/10.1007/978-3-319-09039-9?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 515.39 
520 |a 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