Small Semi-weakly Universal Turing Machines

DOI10.1007/978-3-540-74593-8_26zbMath1159.68462OpenAlexW1740357362MaRDI QIDQ3608492

Damien Woods, Turlough Neary

Publication date: 5 March 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://mural.maynoothuniversity.ie/12415/1/Woods_SmallSemi_2009.pdf

Mathematics Subject Classification ID

Turing machines and related notions (03D10)

Related Items (10)

The Complexity of Small Universal Turing Machines: A Survey ⋮ Abstract geometrical computation. VIII: Small machines, accumulations \& rationality ⋮ Abstract geometrical computation. IV: Small Turing universal signal machines ⋮ On the complex behavior of simple tag systems -- an experimental approach ⋮ Simplicity via provability for universal prefix-free Turing machines ⋮ Reversible computing and cellular automata -- a survey ⋮ On the Computational Complexity of Spiking Neural P Systems ⋮ Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources ⋮ How Redundant Is Your Universal Computation Device? ⋮ The complexity of small universal Turing machines: A survey

This page was built for publication: Small Semi-weakly Universal Turing Machines