Four Small Universal Turing Machines
From MaRDI portal
Recommendations
- Four Small Universal Turing Machines
- scientific article; zbMATH DE number 1746682
- Small universal Turing machines
- Small fast universal Turing machines
- Small Weakly Universal Turing Machines
- MINSKY'S SMALL UNIVERSAL TURING MACHINE
- Small Turing universal signal machines
- scientific article; zbMATH DE number 1992427
- The Complexity of Small Universal Turing Machines
- Small Semi-Weakly Universal Turing Machines
Cited in
(32)- The complexity of small universal Turing machines: A survey
- Small universal Turing machines
- On machines, universal by extensions
- Small universal register machines
- Nine universal circular Post machines
- 2-state 2-symbol Turing machines with periodic support produce regular sets
- Tag systems and Collatz-like functions
- Small fast universal Turing machines
- Universal reversible Turing machines with a small number of tape symbols
- The Complexity of Small Universal Turing Machines: A Survey
- Universality in infinite Petri nets
- ON THE OPTIMAL NUMBER OF INSTRUCTIONS FOR UNIVERSAL TURING MACHINES CONNECTED WITH A FINITE AUTOMATON
- A universal generalized register machine with seven states
- On the Computational Complexity of Spiking Neural P Systems
- A Universal Reversible Turing Machine
- Small Semi-weakly Universal Turing Machines
- Small Semi-Weakly Universal Turing Machines
- MINSKY'S SMALL UNIVERSAL TURING MACHINE
- scientific article; zbMATH DE number 515723 (Why is no real title available?)
- scientific article; zbMATH DE number 1992427 (Why is no real title available?)
- scientific article; zbMATH DE number 1746682 (Why is no real title available?)
- scientific article; zbMATH DE number 2087234 (Why is no real title available?)
- Surprising areas in the quest for small universal devices
- Average-Case Completeness in Tag Systems
- How Redundant Is Your Universal Computation Device?
- Four Small Universal Turing Machines
- On quasi-unilateral universal Turing machines
- Small universal circular Post machines
- On the complex behavior of simple tag systems -- an experimental approach
- Simplicity via provability for universal prefix-free Turing machines
- A provably stable neural network Turing machine with finite precision and time
- Reversible computing and cellular automata -- a survey
This page was built for publication: Four Small Universal Turing Machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5901452)