Editors:
- Provides accessible and lively excursions into mathematical machines geared for universal computation
- Advances broadly interesting topics of universal computation, automata, and theoretical computer science
- Comprised of unique chapters written by world top experts in theory of mathematical machines and computation
- Lavishly illustrated with visually attractive examples of mathematical machines, which will appeal not only to scientists but also to artists and general public
Part of the book series: Emergence, Complexity and Computation (ECC, volume 12)
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (17 chapters)
-
Front Matter
-
Back Matter
About this book
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.
Editors and Affiliations
-
Unconventional Computing Centre, University of the West of England, Bristol, United Kingdom
Andrew Adamatzky
Bibliographic Information
Book Title: Automata, Universality, Computation
Book Subtitle: Tribute to Maurice Margenstern
Editors: Andrew Adamatzky
Series Title: Emergence, Complexity and Computation
DOI: https://doi.org/10.1007/978-3-319-09039-9
Publisher: Springer Cham
eBook Packages: Engineering, Engineering (R0)
Copyright Information: Springer International Publishing Switzerland 2015
Hardcover ISBN: 978-3-319-09038-2Published: 01 December 2014
Softcover ISBN: 978-3-319-36367-7Published: 23 August 2016
eBook ISBN: 978-3-319-09039-9Published: 15 November 2014
Series ISSN: 2194-7287
Series E-ISSN: 2194-7295
Edition Number: 1
Number of Pages: XI, 418
Number of Illustrations: 83 b/w illustrations, 24 illustrations in colour
Topics: Complexity, Applications of Graph Theory and Complex Networks, Mathematical Applications in Computer Science