Constructs Turing machines for Brocard's problem and Fermat primes that halt iff solutions exist and links the minimum state count to a decidability classification using Busy Beaver numbers.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Measuring Decidability as Related to Busy Beaver Numbers
Constructs Turing machines for Brocard's problem and Fermat primes that halt iff solutions exist and links the minimum state count to a decidability classification using Busy Beaver numbers.