Recursively enumerable complexity sequences and measure independence

DOI10.2307/2273412zbMath0454.03019OpenAlexW2063202211MaRDI QIDQ3901505

Victor L. Bennison

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

zbMATH Keywords

complexity measureabstract computational complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (1)

Some lowness properties and computational complexity sequences

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

This page was built for publication: Recursively enumerable complexity sequences and measure independence