Automata, Universality, Computation

Automata, Universality, Computation

Tribute to Maurice Margenstern

Adamatzky, Andrew

Springer International Publishing AG

08/2016

418

Mole

Inglês

9783319363677

15 a 20 dias

6496

Descrição não disponível.
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.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
Automata;Cellular Automata;Complexity Logical Theory;Grossones;Mathematical Machines;P-Systems;Turing Machine;Universal Computation;complexity