On generalized computational complexity

DOI10.2307/2272317MaRDI QIDQ4163200zbMATH OpenOpenAlexFDO

Authors Barry E. Jacobs

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

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cites work

• A Machine-Independent Theory of the Complexity of Recursive Functions
• An Overview of the Theory of Computational Complexity
• Computational Complexity and the Existence of Complexity Gaps
• Consistency of the Continuum Hypothesis. (AM-3)
• scientific article; zbMATH DE number 194101 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• On suborderings of the α-recursively enumerable α-degrees
• On the recursive functions of ordinal numbers
• The Operator Gap
• The α-finite injury method

Cited in

(3)

• The basic theory of partial -recursive operators
• On computational complexity in weakly admissible structures
• The operator gap theorem in α-recursion theory

This page was built for publication: On generalized computational complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4163200)