Automata, Universality, Computation

Tribute to Maurice Margenstern
2015
ISBN: 978-3-319-09038-2
Verlag: Springer International Publishing

Buch, Englisch, Band 12, 418 Seiten, HC runder Rücken kaschiert, Format (B × H): 160 mm x 241 mm, Gewicht: 7686 g

Reihe: Emergence, Complexity and Computation

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.

Zielgruppe

Research

Autoren/Hrsg.

Adamatzky, Andrew

Fachgebiete

• Mathematik | Informatik EDV | Informatik Informatik Theoretische Informatik
• Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
• Mathematik | Informatik EDV | Informatik Informatik Berechenbarkeitstheorie, Komplexitätstheorie

Inhaltsverzeichnis

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.