Fr. 135.00

Automata, Universality, Computation - Tribute to Maurice Margenstern

English · Paperback / Softback

Shipping usually within 6 to 7 weeks

Description

Read more

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.

List of contents

The common structure of the curves having a same Gauss word.- Logical theory of the additive monoid of subsets of natural integers.- Some reflections on mathematics and its relation to computer Science.- Sampling a Two-way Finite Automaton.- Constructing reversible Turing machines by reversible logic element with memory.- The Grossone methodology perspective on Turing machines.- On Parallel Array P Systems.- Computational models based on splicing.- Linear Cellular Automata and Decidability.- Algorithms with Active Cells Modeled by Cellular Automata with Write-Access (CA-w).- Broadcasting automata and patterns on Z2.- Real-Time Prime Generators Implemented on Small-State Cellular Automata.- Phyllosilicate Automata.

Summary

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.

Product details

Assisted by Andre Adamatzky (Editor), Andrew Adamatzky (Editor)
Publisher Springer, Berlin
 
Languages English
Product format Paperback / Softback
Released 01.01.2016
 
EAN 9783319363677
ISBN 978-3-31-936367-7
No. of pages 418
Dimensions 155 mm x 23 mm x 235 mm
Weight 651 g
Illustrations XI, 418 p. 107 illus., 24 illus. in color.
Series Emergence, Complexity and Computation
Emergence, Complexity and Computation
Subjects Natural sciences, medicine, IT, technology > Technology > General, dictionaries

B, Theoretische Informatik, engineering, complexity, Physics, Mathematical Applications in Computer Science, Mathematical physics, Computer mathematics, Complex analysis, complex variables, Computer science—Mathematics, Mathematical modelling, Graph Theory, Applications of Graph Theory and Complex Networks, Applied Dynamical Systems, Computational complexity

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.