The following pages link to (Q4850464):
Displaying 9 items.
- A DNA computing inspired computational model (Q953543) (← links)
- The complexity of small universal Turing machines: A survey (Q1004087) (← links)
- On machines, universal by extensions (Q1349857) (← links)
- Frontier between decidability and undecidability: A survey (Q1575913) (← links)
- Computing by Floating Strings (Q2864199) (← 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)
- On quasi-unilateral universal Turing machines (Q5941258) (← links)
