Turing machine and its symbolic simulation
From MaRDI portal
Recommendations
- On Formalisms for Turing Machines
- Deterministic simulation of non-deterministic Turing machines (detailed abstract)
- Improved simulation of nondeterministic Turing machines
- Turing machines. Introduction to the characterization of the complexity of a problem
- Improved simulation of nondeterministic Turing machines
Cited in
(12)- Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
- Simulating Turing machines on Maurer machines
- Turing machines for dummies. Why representations do matter
- Turing Machine-Inspired Computer Science Results
- Observability of Turing machines: a refinement of the theory of computation
- Modeling non-branching programs with conditional stopping on a universal Turing machine
- scientific article; zbMATH DE number 1735649 (Why is no real title available?)
- scientific article; zbMATH DE number 1396672 (Why is no real title available?)
- Deterministic simulation of non-deterministic Turing machines (detailed abstract)
- On Formalisms for Turing Machines
- New Computational Paradigms
- Turing machines and bimachines
This page was built for publication: Turing machine and its symbolic simulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3144250)
