The following pages link to (Q3661558):
Displaying 15 items.
- Abstract geometrical computation. IV: Small Turing universal signal machines (Q616493) (← links)
- On the complex behavior of simple tag systems -- an experimental approach (Q616497) (← links)
- Busy beaver competition and Collatz-like problems (Q688516) (← links)
- Small Turing machines and generalized busy beaver competition (Q703533) (← links)
- The complexity of small universal Turing machines: A survey (Q1004087) (← links)
- Small universal Turing machines (Q1349852) (← links)
- Small deterministic Turing machines (Q1349854) (← links)
- On machines, universal by extensions (Q1349857) (← links)
- Small universal register machines (Q1349859) (← links)
- Frontier between decidability and undecidability: A survey (Q1575913) (← links)
- Tag systems and Collatz-like functions (Q2474075) (← links)
- The laterality problem for non-erasing Turing machines on $\lbrace 0,1\rbrace $ is completely solved (Q4349780) (← links)
- Non-erasing turing machines: A new frontier between a decidable halting problem and universality (Q5096346) (← links)
- How Redundant Is Your Universal Computation Device? (Q5191172) (← links)
- On quasi-unilateral universal Turing machines (Q5941258) (← links)
