Busy beaver machines and the observant otter heuristic (or how to tame dreadful dragons)

DOI10.1016/j.tcs.2016.07.016zbMath1348.68053arXiv1602.03228OpenAlexW2261544458WikidataQ115046237 ScholiaQ115046237MaRDI QIDQ306278

James Harland

Publication date: 31 August 2016

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

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

zbMATH Keywords

Turing machinesbusy beaverplacid platypus

Mathematics Subject Classification ID

Related Items (1)

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

Uses Software

• Flyspeck
• kepler98

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Busy beaver competition and Collatz-like problems
• Complexity of Langton's ant
• Improved bounds for functions related to busy beavers
• A proof of the Kepler conjecture
• Problems in number theory from busy beaver competition
• Computability and Logic
• The Determination of the Value of Rado's Noncomputable Function | sum(k) for Four-State Turing Machines
• A note on busy beavers and other creatures
• On Non-Computable Functions
• Computer Studies of Turing Machine Problems

This page was built for publication: Busy beaver machines and the observant otter heuristic (or how to tame dreadful dragons)