Diversity of speed-ups and embeddability in computational complexity
From MaRDI portal
Publication:4154062
DOI10.2307/2272959zbMath0375.68024OpenAlexW4242730514MaRDI QIDQ4154062
Publication date: 1976
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2272959
Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items
An operator embedding theorem for complexity classes of recursive functions, Uncontrollable computational growth in theoretical physics
