Pages that link to "Item:Q5901452"
From MaRDI portal
The following pages link to Four Small Universal Turing Machines (Q5901452):
Displayed 12 items.
- On the complex behavior of simple tag systems -- an experimental approach (Q616497) (← links)
- Simplicity via provability for universal prefix-free Turing machines (Q616504) (← links)
- Reversible computing and cellular automata -- a survey (Q924686) (← links)
- The complexity of small universal Turing machines: A survey (Q1004087) (← links)
- Tag systems and Collatz-like functions (Q2474075) (← links)
- The Complexity of Small Universal Turing Machines: A Survey (Q2891384) (← links)
- Universality in Infinite Petri Nets (Q2945886) (← links)
- On the Computational Complexity of Spiking Neural P Systems (Q3543343) (← links)
- Surprising Areas in the Quest for Small Universal Devices (Q4982064) (← links)
- Average-Case Completeness in Tag Systems (Q5090467) (← links)
- How Redundant Is Your Universal Computation Device? (Q5191172) (← links)
- A provably stable neural network Turing machine with finite precision and time (Q6193467) (← links)