Pages that link to "Item:Q3862403"
From MaRDI portal
The following pages link to Towards a Precise Characterization of the Complexity of Universal and Nonuniversal Turing Machines (Q3862403):
Displaying 7 items.
- Automata and concurrency (Q794437) (← links)
- Computation theoretic aspects of cellular automata (Q807035) (← links)
- 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)