Automata, Universality, Computation - Tribute to Maurice Margenstern (Paperback, Softcover reprint of the original 1st ed. 2015)

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.

General

Imprint:	Springer International Publishing AG
Country of origin:	Switzerland
Series:	Emergence, Complexity and Computation, 12
Release date:	August 2016
First published:	2015
Editors:	Andrew Adamatzky
Dimensions:	235 x 155 x 22mm (L x W x T)
Format:	Paperback
Pages:	418
Edition:	Softcover reprint of the original 1st ed. 2015
ISBN-13:	978-3-319-36367-7
Categories:	Books > Science & Mathematics > Physics > General Books > Reference & Interdisciplinary > Communication studies > Information theory > Cybernetics & systems theory Books > Science & Mathematics > Mathematics > Applied mathematics > Mathematical modelling
LSN:	3-319-36367-0
Barcode:	9783319363677

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!