Pages that link to "Item:Q1349857"
From MaRDI portal
The following pages link to On machines, universal by extensions (Q1349857):
Displaying 16 items.
- Simplicity via provability for universal prefix-free Turing machines (Q616504) (← links)
- Instruction sequence processing operators (Q715042) (← links)
- The complexity of small universal Turing machines: A survey (Q1004087) (← links)
- A universal machine without change of state (Q1100903) (← links)
- Small universal register machines (Q1349859) (← links)
- Frontier between decidability and undecidability: A survey (Q1575913) (← links)
- Structured Turing machines (Q1780228) (← links)
- Universality in two dimensions (Q2804324) (← links)
- On extension theorems and their connection to universal consistency in machine learning (Q2835986) (← links)
- The Complexity of Small Universal Turing Machines: A Survey (Q2891384) (← links)
- ON THE OPTIMAL NUMBER OF INSTRUCTIONS FOR UNIVERSAL TURING MACHINES CONNECTED WITH A FINITE AUTOMATON (Q3043622) (← links)
- Theory of Extended Linear Machines (Q4571274) (← links)
- (Q5224793) (← links)
- Machines, Computations, and Universality (Q5710883) (← links)
- On the existence of universally convergent mechanisms (Q5894574) (← links)
- On the existence of universally convergent mechanisms (Q5906470) (← links)