The following pages link to (Q4723304):
Displaying 5 items.
- The complexity of small universal Turing machines: A survey (Q1004087) (← links)
- Universal Turing machines with complexity constraint (Q2770681) (← links)
- The Complexity of Small Universal Turing Machines: A Survey (Q2891384) (← links)
- Anytime Algorithms for Non-Ending Computations (Q2947801) (← links)
- Machines, Computations, and Universality (Q5710883) (← links)