Abstract geometrical computation. IV: Small Turing universal signal machines

DOI10.1016/j.tcs.2010.07.013zbMath1207.68140OpenAlexW2075655200MaRDI QIDQ616493

Jérôme O. Durand-Lose

Publication date: 10 January 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.07.013

zbMATH Keywords

Turing universalityabstract geometrical computationcyclic tag systemssignal machinessmall universal machines

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items

Exact Discretization of 3-Speed Rational Signal Machines into Cellular Automata ⋮ Abstract geometrical computation. VIII: Small machines, accumulations \& rationality ⋮ Abstract geometrical computation. V: Embedding computable analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Abstract geometrical computation. III: Black holes for classical and analog computing
• The complexity of small universal Turing machines: A survey
• Signals in one-dimensional cellular automata
• Small universal Turing machines
• Small deterministic Turing machines
• Small universal register machines
• Theory of cellular automata: a survey
• Small fast universal Turing machines
• Small Weakly Universal Turing Machines
• Small Semi-weakly Universal Turing Machines
• P-completeness of Cellular Automaton Rule 110
• Small Semi-Weakly Universal Turing Machines
• Non-erasing turing machines: A new frontier between a decidable halting problem and universality
• Machines, Computations, and Universality
• New Computational Paradigms
• Four Small Universal Turing Machines

This page was built for publication: Abstract geometrical computation. IV: Small Turing universal signal machines