The Complexity of Small Universal Turing Machines

DOI10.1007/978-3-540-73001-9_84zbMath1151.68413OpenAlexW1483817375MaRDI QIDQ5425384

Turlough Neary, Damien Woods

Publication date: 13 November 2007

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

Full work available at URL: https://doi.org/10.1007/978-3-540-73001-9_84

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (2)

Simplicity via provability for universal prefix-free Turing machines ⋮ The complexity of small universal Turing machines: A survey

This page was built for publication: The Complexity of Small Universal Turing Machines