Pages that link to "Item:Q2891384"
From MaRDI portal
The following pages link to The Complexity of Small Universal Turing Machines: A Survey (Q2891384):
Displaying 10 items.
- On Goles' universal machines: a computational point of view (Q393156) (← links)
- The instructional information processing account of digital computation (Q484961) (← links)
- Parsimonious computational completeness (Q832917) (← links)
- Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy (Q2509952) (← links)
- Small Universal Devices (Q2944894) (← links)
- Universality in Molecular and Cellular Computing (Q3195684) (← links)
- Maurice Margenstern’s Contributions to the Field of Small Universal Turing Machines (Q4982992) (← links)
- Small Universal Reversible Counter Machines (Q5112183) (← links)
- Investigations on the power of matrix insertion-deletion systems with small sizes (Q6061993) (← links)
- Linear Bounds on the Size of Conformations in Greedy Deterministic Oritatami (Q6169891) (← links)
