Strong time bounds: Non-computable bounds and a hierarchy theorem

DOI10.1016/0304-3975(90)90181-GzbMath0694.68038MaRDI QIDQ909465

John Michael Robson

Publication date: 1990

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

computable functionshierarchytime boundscomplexity of computation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cites Work

• Unnamed Item
• Time bounded random access machines
• On genuinely time bounded computations

This page was built for publication: Strong time bounds: Non-computable bounds and a hierarchy theorem