Measuring Decidability as Related to Busy Beaver Numbers

Abstract

The theoretical existence of Busy Beaver numbers provides a new notion for decidability and corresponding heuristic for conjectures. The minimum number of states in which a conjecture can be modeled gives a classification of what logic system can describe said conjecture. In this work, we construct explicit Turing machines that search for a solution to Brocard's problem greater than 7 and a Fermat prime beyond the 4th which halt if and only if such a solution exists.

arXiv commentPreprint. 19 pages. 4 tables. 4 Turing machine diagrams. 12 tape state diagrams