Recursive turing machines †

DOI10.1080/00207167708803124zbMATH Open0355.02029OpenAlexW2093810711MaRDI QIDQ4126327FDOQ4126327

Authors: Walter Savitch 

Publication date: 1977

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Turing machines and related notions (03D10)

Cites Work

• Relationships between nondeterministic and deterministic tape complexities
• Title not available (Why is that?)
• Characterizations of Pushdown Machines in Terms of Time-Bounded Computers

Cited In (2)

• Hierarchies of recursive computations†
• Parallel random access machines with powerful instruction sets

This page was built for publication: Recursive turing machines †

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