The following pages link to (Q4383577):
Displaying 5 items.
- 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)
- 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)