Text

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

---

Availability

No copy data

Detail Information

Series Title

-

Call Number

511.5

Publisher

Cham : ., 2015

Collation

XI, 418

Language

English

ISBN/ISSN

978-3-319-09039-9

Classification

511.5

Content Type

text

Media Type

computer

Carrier Type

-

Edition

-

Subject(s)

Graph Theory

Specific Detail Info

-

Statement of Responsibility

Andrew Adamatzky

Other Information

Cataloger

ratna

Source

https://link.springer.com/book/10.1007/978-3-319-09039-9

Validator

-

Other version/related

File Attachment

Comments

---

You must be logged in to post a comment