On generalized computational complexity
From MaRDI portal
Publication:4163200
DOI10.2307/2272317zbMath0384.03022OpenAlexW2083398725MaRDI QIDQ4163200
Publication date: 1977
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2272317
Complexity of computation (including implicit computational complexity) (03D15) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items
The basic theory of partial \(\alpha\)-recursive operators ⋮ On computational complexity in weakly admissible structures ⋮ The operator gap theorem in α-recursion theory
Cites Work
- On the recursive functions of ordinal numbers
- A Machine-Independent Theory of the Complexity of Recursive Functions
- An Overview of the Theory of Computational Complexity
- The Operator Gap
- Computational Complexity and the Existence of Complexity Gaps
- The α-finite injury method
- On suborderings of the α-recursively enumerable α-degrees
- Consistency of the Continuum Hypothesis. (AM-3)
- Unnamed Item
- Unnamed Item
