Busy beavers gone wild

MaRDI QIDQ5145155zbMATH OpenFDO

Authors Grégory Lafitte

Publication date 20 January 2021

Full work available at URL https://arxiv.org/abs/0906.3257, http://eptcs.web.cse.unsw.edu.au/paper.cgi?CSP08.12

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Algorithmic randomness and dimension (03D32) Gödel numberings and issues of incompleteness (03F40)

Recommendations

• A note on busy beavers and other creatures
• A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory
• Improved bounds for functions related to busy beavers
• Busy beaver machines and the observant otter heuristic (or how to tame dreadful dragons)
• Busy beavers and Kolmogorov complexity

Cited in

(5)

• Busy beaver scores and alphabet size
• The ``paradox of computability and a recursive relative version of the busy beaver function
• Busy beavers and Kolmogorov complexity
• scientific article; zbMATH DE number 4123308 (Why is no real title available?)
• Combining Finite Combination Properties: Finite Models and Busy Beavers

This page was built for publication: Busy beavers gone wild

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