Recursively enumerable complexity sequences and measure independence

DOI10.2307/2273412MaRDI QIDQ3901505zbMATH OpenOpenAlexFDO

Authors 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

abstract computational complexitycomplexity measure

Mathematics Subject Classification ID

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

Cites work

• A Machine-Independent Theory of the Complexity of Recursive Functions
• An Overview of the Theory of Computational Complexity
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• On some games which are relevant to the theory of recursively enumerable sets
• Recursive Properties of Abstract Complexity Classes
• Some lowness properties and computational complexity sequences

Cited in

(1)

• Some lowness properties and computational complexity sequences

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

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