Turing machine and its symbolic simulation

zbMATH Open1265.68072MaRDI QIDQ3144250FDOQ3144250

Authors Saša V. Vukašinović, Predrag S. Stanimirović, Marko D. Petković, Miroslav Ćirić 

Publication date 7 December 2012

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to computer science (68-04)

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 machines and bimachines
• Turing machines for dummies. Why representations do matter
• Deterministic simulation of non-deterministic Turing machines (detailed abstract)
• Turing Machine-Inspired Computer Science Results
• Modeling non-branching programs with conditional stopping on a universal Turing machine
• Simulating Turing machines on Maurer machines
• scientific article; zbMATH DE number 1396672 (Why is no real title available?)
• Observability of Turing machines: a refinement of the theory of computation
• scientific article; zbMATH DE number 1735649 (Why is no real title available?)
• On Formalisms for Turing Machines
• New Computational Paradigms

Describes a project that uses

Uses Software

• Mathematica

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)