The following pages link to On Formalisms for Turing Machines (Q5535413):
Displaying 19 items.
- A formalization of multi-tape Turing machines (Q744986) (← links)
- The complexity of small universal Turing machines: A survey (Q1004087) (← links)
- Remark on the computational power of a Turing machine variant (Q1212929) (← links)
- Closed-form analytic maps in one and two dimensions can simulate universal Turing machines (Q1274815) (← links)
- Structured Turing machines (Q1780228) (← links)
- On the structural simplicity of machines and languages (Q1924785) (← links)
- On TAE machines and their computational power (Q2334651) (← links)
- Simulating Turing machines on Maurer machines (Q2480963) (← links)
- Multitape one-way nonwriting automata (Q2527943) (← links)
- Simultaneous Markov-like algorithms. (Q2769188) (← links)
- The Complexity of Small Universal Turing Machines: A Survey (Q2891384) (← links)
- Formalizing Turing Machines (Q2915013) (← links)
- (Q4099618) (← links)
- (Q4325365) (← links)
- Automata, Languages and Programming (Q5466485) (← links)
- (Q5552753) (← links)
- A New Hierarchy of Elementary Functions (Q5570927) (← links)
- The unsolvability of the uniform halting problem for two state Turing machines (Q5570931) (← links)
- New Computational Paradigms (Q5717036) (← links)