Independence from ZFC

From BusyBeaverWiki
Revision as of 15:56, 21 July 2025 by Sligocki (talk | contribs) (→‎History: Clarify that some are self-reported)
Jump to navigation Jump to search

For any computable and arithmetically sound axiomatic theory T, there exists an integer such that T cannot prove the values of BB(n) for any . For ZF, this value is known to be in the range:

This lower bound comes from the fact that BB(5) has been proven in Rocq. The upper bound comes from an explicit TM which enumerates all possible proofs in ZF and halts if it finds a proof 0 = 1. Assuming ZF is consistent, then it cannot prove its own consistency, hence it cannot prove whether this specific TM halts.

Scott Aaronson conjectured in his Busy Beaver Frontier survey[1] that .

History

There is no one authoritative source on the history of TMs independent of ZF, this is our best understanding of the history of TMs found. Mostly these are taken from Scott Aaronson's blog announcements and Busy Beaver Frontier or self-reported by the individuals who discovered them.

History of ZF independent TMs
States Date Discoverer Source Verification
7910 May 2016 Adam Yedidia and Scott Aaronson Yedida and Aaronson 2016[2]
748 May 2016 Stefan O’Rear Github NQL file, Busy Beaver Frontier[1]
745 July 2023 Johannes Riebel Riebel 2023 Bachelor Thesis[3]
643 July 2024 Rohan Ridenour Github NQL, Aaronson Announcement
636 31 August 2024 Rohan Ridenour Github NQL (commit)
588 12 July 2025 andrew-j-wade Github NQL (commit)
564 13 July 2025 andrew-j-wade Github NQL (commit)
559 15 July 2025 andrew-j-wade Github NQL (commit)
549 16 July 2025 andrew-j-wade Github NQL (commit)

References

  1. 1.0 1.1 Scott Aaronson. 2020. The Busy Beaver Frontier. SIGACT News 51, 3 (August 2020), 32–54. https://doi.org/10.1145/3427361.3427369
  2. A. Yedidia and S. Aaronson. A relatively small Turing machine whose behavior is independent of set theory. Complex Systems, (25):4, 2016. https://arxiv.org/abs/1605.04343
  3. Riebel, Johannes (March 2023). The Undecidability of BB(748): Understanding Gödel's Incompleteness Theorems (PDF) (Bachelor's thesis). University of Augsburg.