On the Simplicity of Busy Beaver Sets

DOI10.1002/MALQ.19780241303MaRDI QIDQ3853609zbMATH OpenOpenAlexFDO

Authors Robert P. Daley

Publication date 1978

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19780241303

zbMATH Keywords

busy beaver n-gameinefficiency lemma

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cited in

(4)

• Independence results in computer science?
• On the inference of optimal descriptions
• Busy beaver sets and the degrees of unsolvability
• Constructivity conditions on immune sets

This page was built for publication: On the Simplicity of Busy Beaver Sets

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