Four Small Universal Turing Machines

DOI10.1007/978-3-540-74593-8_21zbMath1159.68461OpenAlexW1838451616MaRDI QIDQ5901452

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/12416/1/Woods_FourSmall_2009.pdf

Mathematics Subject Classification ID

Turing machines and related notions (03D10)

Related Items (12)

The Complexity of Small Universal Turing Machines: A Survey ⋮ Universality in Infinite Petri Nets ⋮ On the complex behavior of simple tag systems -- an experimental approach ⋮ Simplicity via provability for universal prefix-free Turing machines ⋮ A provably stable neural network Turing machine with finite precision and time ⋮ Reversible computing and cellular automata -- a survey ⋮ On the Computational Complexity of Spiking Neural P Systems ⋮ Tag systems and Collatz-like functions ⋮ How Redundant Is Your Universal Computation Device? ⋮ The complexity of small universal Turing machines: A survey ⋮ Average-Case Completeness in Tag Systems ⋮ Surprising Areas in the Quest for Small Universal Devices

This page was built for publication: Four Small Universal Turing Machines