Automata, Universality, Computation: Tribute to Maurice Margenstern (2015) (Emergence, Complexity and Computation #12)

By:

Sign Up Now! Already a Member? Log In
You must be logged into UK education collection to access this title. Learn about membership options, or view our freely available titles.

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.
Copyright:
2015

Book Details

Book Quality:
Publisher Quality
ISBN-13:
9783319090399
Related ISBNs:
9783319090382
Publisher:
Springer International Publishing
Date of Addition:
Copyrighted By:
N/A
Adult content:
No
Language:
English
Has Image Descriptions:
No
Categories:
Nonfiction, Science, Technology, Mathematics and Statistics
Submitted By:
Bookshare Staff
Usage Restrictions:
This is a copyrighted book.
Edited by:
Andrew Adamatzky

Reviews

No Rating Yet