On the Simplicity of Busy Beaver Sets

DOI10.1002/malq.19780241303zbMath0421.03031OpenAlexW2088638692MaRDI QIDQ3853609

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

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

Related Items

Independence results in computer science?, On the inference of optimal descriptions, Busy beaver sets and the degrees of unsolvability