Zum Hauptinhalt springen
Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Automata, Universality, Computation -

Automata, Universality, Computation

Tribute to Maurice Margenstern

Andrew Adamatzky (Herausgeber)

Buch | Softcover
XI, 418 Seiten
2016 | Softcover reprint of the original 1st ed. 2015
Springer International Publishing (Verlag)
978-3-319-36367-7 (ISBN)
CHF 195,95 inkl. MwSt
  • Versand in 10-15 Tagen
  • Versandkostenfrei
  • Auch auf Rechnung
  • Artikel merken

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.

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.

Erscheinungsdatum
Reihe/Serie Emergence, Complexity and Computation
Zusatzinfo XI, 418 p. 107 illus., 24 illus. in color.
Verlagsort Cham
Sprache englisch
Maße 155 x 235 mm
Themenwelt Mathematik / Informatik Informatik Theorie / Studium
Mathematik / Informatik Mathematik Angewandte Mathematik
Technik
Schlagworte Automata • Cellular Automata • Complex analysis, complex variables • Complexity • Complexity Logical Theory • complex networks • Cybernetics and systems theory • Engineering • Grossones • Mathematical Applications in Computer Science • Mathematical Machines • Mathematical Modelling • Mathematical Physics • P-systems • Turing Machine • Universal Computation
ISBN-10 3-319-36367-0 / 3319363670
ISBN-13 978-3-319-36367-7 / 9783319363677
Zustand Neuware
Informationen gemäß Produktsicherheitsverordnung (GPSR)
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
was jeder über Informatik wissen sollte

von Timm Eichstädt; Stefan Spieker

Buch | Softcover (2024)
Springer Vieweg (Verlag)
CHF 53,15
Teil 2 der gestreckten Abschlussprüfung Fachinformatiker/-in …

von Dirk Hardy; Annette Schellenberg; Achim Stiefel

Buch | Softcover (2025)
Europa-Lehrmittel (Verlag)
CHF 37,90