On restricted turing computability

DOI10.1007/BF01694077MaRDI QIDQ5632561zbMATH OpenFDO

Authors E. P. Glinert

Publication date 1971

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

Full work available at URL https://doi.org/10.1007/BF01694077

Mathematics Subject Classification ID

Turing machines and related notions (03D10)

Cites work

• scientific article; zbMATH DE number 3363526 (Why is no real title available?)
• scientific article; zbMATH DE number 3407150 (Why is no real title available?)
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Computational Complexity of One-Tape Turing Machine Computations
• On Computable Numbers, with an Application to the Entscheidungsproblem
• On the Computational Complexity of Algorithms
• One-tape, off-line Turing machine computations
• Relations Between Time and Tape Complexities
• Turing machines with a schedule to keep
• Two-Tape Simulation of Multitape Turing Machines

Cited in

(3)

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

This page was built for publication: On restricted turing computability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5632561)