Computational speed-up by effective operators
From MaRDI portal
Publication:5663367
DOI10.2307/2272545zbMath0249.68018OpenAlexW2020242021MaRDI QIDQ5663367
Patrick C. Fischer, Albert R. Meyer
Publication date: 1972
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2272545
Analysis of algorithms and problem complexity (68Q25) Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10)
Related Items (20)
On recursive bounds for the exceptional values in speed-up ⋮ Characterization of realizable space complexities ⋮ Computational complexity of functions ⋮ New axiomatics for relevant logics. I ⋮ Speedup for natural problems and noncomputability ⋮ Complexity of algorithms and computations ⋮ Effective category and measure in abstract complexity theory ⋮ The complexity types of computable sets ⋮ Effective category and measure in abstract complexity theory ⋮ Augmented loop languages and classes of computable functions ⋮ An operator embedding theorem for complexity classes of recursive functions ⋮ Quantitative aspects of speed-up and gap phenomena ⋮ Some applications of the McCreight-Meyer algorithm in abstract complexity theory ⋮ Resource restricted computability theoretic learning: Illustrative topics and problems ⋮ Speed-up theorems in type-2 computations using oracle Turing machines ⋮ The complexity of total order structures ⋮ Some lowness properties and computational complexity sequences ⋮ Easy Constructions in Complexity Theory: Gap and Speed-Up Theorems ⋮ Relativization of the Theory of Computational Complexity ⋮ Uncontrollable computational growth in theoretical physics
Cites Work
This page was built for publication: Computational speed-up by effective operators
