Busy beaver sets and the degrees of unsolvability

DOI10.2307/2273749zbMath0486.03022OpenAlexW1997549135MaRDI QIDQ3946155

Robert P. Daley

Publication date: 1981

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

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

zbMATH Keywords

Post's problemBlum measure of computational complexity

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Hypersimple sets with retraceable complements
• On the Simplicity of Busy Beaver Sets
• A Machine-Independent Theory of the Complexity of Recursive Functions
• On the size of machines
• Recursively enumerable sets of positive integers and their decision problems

This page was built for publication: Busy beaver sets and the degrees of unsolvability