Generating candidate busy beaver machines (or how to build the zany zoo)

DOI10.1016/J.TCS.2022.04.040OpenAlexW2531269169MaRDI QIDQ2672601

James Harland

Publication date: 13 June 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

Turing machinesnormal formsbusy beaver

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• Flyspeck
• kepler98

Cites Work

• Unnamed Item
• Unnamed Item
• Busy beaver machines and the observant otter heuristic (or how to tame dreadful dragons)
• Busy beaver competition and Collatz-like problems
• Examples, counterexamples, and measuring fuzzy associations
• Busy beaver scores and alphabet size
• A proof of the Kepler conjecture
• Computability and Logic
• The Determination of the Value of Rado's Noncomputable Function | sum(k) for Four-State Turing Machines
• On Non-Computable Functions
• Computer Studies of Turing Machine Problems
• An Unsolvable Problem of Elementary Number Theory
• On Computable Numbers, with an Application to the Entscheidungsproblem

This page was built for publication: Generating candidate busy beaver machines (or how to build the zany zoo)