Computational speed-up by effective operators
From MaRDI portal
Cites work
- A Machine-Independent Theory of the Complexity of Recursive Functions
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- On Effective Procedures for Speeding Up Algorithms
- On size vs. efficiency for programs admitting speed-ups
- On the size of machines
- Toward a Theory of Enumerations
Cited in
(20)- Uncontrollable computational growth in theoretical physics
- Complexity of algorithms and computations
- The complexity types of computable sets
- Augmented loop languages and classes of computable functions
- An operator embedding theorem for complexity classes of recursive functions
- Some applications of the McCreight-Meyer algorithm in abstract complexity theory
- The complexity of total order structures
- Some lowness properties and computational complexity sequences
- On recursive bounds for the exceptional values in speed-up
- Computational complexity of functions
- New axiomatics for relevant logics. I
- Characterization of realizable space complexities
- Quantitative aspects of speed-up and gap phenomena
- Easy Constructions in Complexity Theory: Gap and Speed-Up Theorems
- Relativization of the Theory of Computational Complexity
- Effective category and measure in abstract complexity theory
- Speedup for natural problems and noncomputability
- Effective category and measure in abstract complexity theory
- Resource restricted computability theoretic learning: Illustrative topics and problems
- Speed-up theorems in type-2 computations using oracle Turing machines
This page was built for publication: Computational speed-up by effective operators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5663367)
