On restricted turing computability

DOI10.1007/BF01694077zbMath0226.02038MaRDI QIDQ5632561

E. P. Glinert

Publication date: 1971

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Turing machines and related notions (03D10)

Related Items

A time-space hierarchy between polynomial time and polynomial space ⋮ Complexity of algorithms and computations ⋮ On time-space classes and their relation to the theory of real addition

Cites Work

• Unnamed Item
• Unnamed Item
• On the Computational Complexity of Algorithms
• Two-Tape Simulation of Multitape Turing Machines
• Turing machines with a schedule to keep
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Computational Complexity of One-Tape Turing Machine Computations
• Relations Between Time and Tape Complexities
• One-tape, off-line Turing machine computations
• On Computable Numbers, with an Application to the Entscheidungsproblem