Turing machine and its symbolic simulation
From MaRDI portal
Publication:3144250
zbMATH Open1265.68072MaRDI QIDQ3144250FDOQ3144250
Authors: Saša V. Vukašinović, Predrag S. Stanimirović, Marko D. Petković, Miroslav Ćirić 
Publication date: 7 December 2012
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 (11)
- Turing Machine-Inspired Computer Science Results
- Simulating Turing machines on Maurer machines
- Deterministic simulation of non-deterministic Turing machines (detailed abstract)
- On Formalisms for Turing Machines
- Modeling non-branching programs with conditional stopping on a universal Turing machine
- Observability of Turing machines: a refinement of the theory of computation
- Title not available (Why is that?)
- New Computational Paradigms
- Turing machines and bimachines
- Turing machines for dummies. Why representations do matter
- Title not available (Why is that?)
Uses Software
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)
