Recursive turing machines †

DOI10.1080/00207167708803124MaRDI QIDQ4126327zbMATH OpenOpenAlexFDO

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

• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
• Relationships between nondeterministic and deterministic tape complexities

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)