The intrinsic difficulty of recursive functions
From MaRDI portal
DOI10.1007/BF00372775zbMATH Open0862.03024MaRDI QIDQ1919986FDOQ1919986
Publication date: 28 July 1996
Published in: Studia Logica (Search for Journal in Brave)
Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Hierarchies of number-theoretic functions. I
- Classifying the computational complexity of problems
- The slow-growing and the Graegorczyk hierarchies
- A Classification of the Recursive Functions
- Theories of computational complexity
- An Overview of the Theory of Computational Complexity
- Classes of Predictably Computable Functions
- A Hierarchy of Primitive Recursive Functions
- On a complexity-based way of constructivizing the recursive functions
- A characterization of the power of vector machines
- Classifications of Recursive Functions by Means of Hierarchies
- Machine Dependence of Degrees of Difficulty
- Ordinal Hierarchies and Naming Complexity Classes
- ``Natural properties of flowchart step-counting measures
Cited In (2)
Recommendations
This page was built for publication: The intrinsic difficulty of recursive functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1919986)