Diversity of speed-ups and embeddability in computational complexity

DOI10.2307/2272959MaRDI QIDQ4154062zbMATH OpenOpenAlexFDO

Authors Donald A. Alton

Publication date 1976

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2272959

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cited in

(2)

• An operator embedding theorem for complexity classes of recursive functions
• Uncontrollable computational growth in theoretical physics

This page was built for publication: Diversity of speed-ups and embeddability in computational complexity

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