Implicit measurements of dynamic complexity properties and splittings of speedable sets

DOI10.2307/2586618zbMath0976.03050OpenAlexW2060623254MaRDI QIDQ4934028

Michael A. Jahn

Publication date: 6 January 2002

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2586618

zbMATH Keywords

localityBlum's machine independent complexity theorypriority treespeedable computably enumerable setsplittings of speedable sets

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursively (computably) enumerable sets and degrees (03D25)

Cites Work

• Unnamed Item
• Unnamed Item
• Splitting theorems in recursion theory
• On speedable and levelable vector spaces
• A limit on relative genericity in the recursively enumerable sets
• Codable sets and orbits of computably enumerable sets
• Computational complexity of recursively enumerable sets
• A Machine-Independent Theory of the Complexity of Recursive Functions
• On Effective Procedures for Speeding Up Algorithms
• Recursive Properties of Abstract Complexity Classes

This page was built for publication: Implicit measurements of dynamic complexity properties and splittings of speedable sets