Provides accessible and lively excursions into mathematical machines geared for universal computation

Advances broadly interesting topics of universal computation, automata, and theoretical computer science

Comprised of unique chapters written by world top experts in theory of mathematical machines and computation

Lavishly illustrated with visually attractive examples of mathematical machines, which will appeal not only to scientists but also to artists and general public

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.