The following pages link to (Q4284259):
Displayed 8 items.
- The complexity of small universal Turing machines: A survey (Q1004087) (← links)
- Small universal Turing machines (Q1349852) (← links)
- Frontier between decidability and undecidability: A survey (Q1575913) (← links)
- Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy (Q2509952) (← links)
- The Complexity of Small Universal Turing Machines: A Survey (Q2891384) (← links)
- The laterality problem for non-erasing Turing machines on $\lbrace 0,1\rbrace $ is completely solved (Q4349780) (← links)
- Maurice Margenstern’s Contributions to the Field of Small Universal Turing Machines (Q4982992) (← links)
- Non-erasing turing machines: A new frontier between a decidable halting problem and universality (Q5096346) (← links)