Pages that link to "Item:Q2770681"
From MaRDI portal
The following pages link to Universal Turing machines with complexity constraint (Q2770681):
Displaying 7 items.
- Simplicity via provability for universal prefix-free Turing machines (Q616504) (← links)
- (Q3343970) (← links)
- (Q4723304) (← links)
- Simulation of circuits of functional elements by the universal Turing machine (Q4825179) (← links)
- Universality of Wolfram’s 2, 3 Turing Machine (Q5126861) (← links)
- 5-Symbol 8-State and 5-Symbol 6-State Universal Turing Machines (Q5535412) (← links)
- Machines, Computations, and Universality (Q5710883) (← links)