Journal of Computer and System Sciences
Nondeterministic space is closed under complementation
SIAM Journal on Computing
Machine models and simulations
Handbook of theoretical computer science (vol. A)
Two-Tape Simulation of Multitape Turing Machines
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Complexity of solvable cases of the decision problem for the predicate calculus
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
On the power of multiplication in random access machines
SWAT '74 Proceedings of the 15th Annual Symposium on Switching and Automata Theory (swat 1974)
A characterization of the power of vector machines
Journal of Computer and System Sciences
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
| Hi-index | 0.00 |
Various methods exists in the litearture for denoting the configuration of a Turing Machine. A key difference is whether the head position is indicated by some integer (mathematical representation) or is specified by writing the machine state next to the scanned tape symbol (intrinsic representation). From a mathematical perspective this will make no difference. However, since Turing Machines are primarily used for proving undecidability and/or hardness results these representations do matter. Based on a number of applications we show that the intrinsic representation should be preferred.