Recursively enumerable complexity sequences and measure independence
From MaRDI portal
Publication:3901505
DOI10.2307/2273412zbMath0454.03019MaRDI QIDQ3901505
Publication date: 1980
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2273412
68Q25: Analysis of algorithms and problem complexity
03D15: Complexity of computation (including implicit computational complexity)
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
Cites Work
- Unnamed Item
- Some lowness properties and computational complexity sequences
- On some games which are relevant to the theory of recursively enumerable sets
- A Machine-Independent Theory of the Complexity of Recursive Functions
- An Overview of the Theory of Computational Complexity
- Recursive Properties of Abstract Complexity Classes