Busy beavers gone wild

zbMATH Open1455.03079arXiv0906.3257MaRDI QIDQ5145155FDOQ5145155

Authors: Grégory Lafitte 

Publication date: 20 January 2021

Full work available at URL: https://arxiv.org/abs/0906.3257

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

Mathematics Subject Classification ID

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

Cited In (5)

• Busy beavers and Kolmogorov complexity
• Title not available (Why is that?)
• Busy beaver scores and alphabet size
• Combining Finite Combination Properties: Finite Models and Busy Beavers
• The ``paradox of computability and a recursive relative version of the busy beaver function

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)