Small universal Turing machines
From MaRDI portal
Publication:1349852
DOI10.1016/S0304-3975(96)00077-1zbMath0874.68106WikidataQ56112365 ScholiaQ56112365MaRDI QIDQ1349852
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
DB lookup for MSC labels failed
Related Items
The laterality problem for non-erasing Turing machines on $\lbrace 0,1\rbrace $ is completely solved, Closed-form analytic maps in one and two dimensions can simulate universal Turing machines, DNA computing based on splicing: Universality results, Frontier between decidability and undecidability: A survey
Cites Work
- Small deterministic Turing machines
- Automata Studies. (AM-34)
- The Definition of Universal Turing Machine
- Towards a Precise Characterization of the Complexity of Universal and Nonuniversal Turing Machines
- MINSKY'S SMALL UNIVERSAL TURING MACHINE
- A New Hierarchy of Elementary Functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item