Hierarchies of recursive computations†

DOI10.1080/00207167908803180zbMath0437.68024OpenAlexW2147242574MaRDI QIDQ3878756

Michael J. Stimson, Walter J. Savitch

Publication date: 1979

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207167908803180

zbMATH Keywords

widthdepthtime complexityTuring machinerecursive algorithmstape complexitynondeterministic algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Turing machines and related notions (03D10) Algorithms in computer science (68W99) Hierarchies of computability and definability (03D55)

Cites Work

• Unnamed Item
• Relationships between nondeterministic and deterministic tape complexities
• Recursive turing machines †
• Time Bounded Random Access Machines with Parallel Processing
• Characterizations of Pushdown Machines in Terms of Time-Bounded Computers

This page was built for publication: Hierarchies of recursive computations†