Automata, Universality, Computation

Automata, Universality, Computation Tribute to Maurice Margenstern - Emergence, Complexity and Computation

Softcover reprint of the original 1st Edition 2015

Paperback (23 Aug 2016)

  • $154.03
Add to basket

Includes delivery to the United States

10+ copies available online - Usually dispatched within 7 days

Publisher's Synopsis

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.

Book information

ISBN: 9783319363677
Publisher: Springer International Publishing
Imprint: Springer
Pub date:
Edition: Softcover reprint of the original 1st Edition 2015
Language: English
Number of pages: 418
Weight: 6496g
Height: 235mm
Width: 155mm
Spine width: 22mm