Automata, Universality, Computation : Tribute to Maurice Margenstern /
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 mathem...
שמור ב:
| מחבר תאגידי: | |
|---|---|
| מחברים אחרים: | |
| פורמט: | ספר אלקטרוני |
| שפה: | English |
| יצא לאור: |
Cham :
Springer International Publishing : Imprint: Springer,
2015.
|
| סדרה: | Emergence, Complexity and Computation,
12 |
| נושאים: | |
| גישה מקוונת: | Click here to view the full text content |
| תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|
תוכן הענינים:
- 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.