Logical independence: Difference between revisions

From BusyBeaverWiki
Jump to navigation Jump to search
Svennik (talk | contribs)
Loader3229 (talk | contribs)
 
(20 intermediate revisions by 2 users not shown)
Line 1: Line 1:
For any recursively enumerable and arithmetically sound axiomatic theory T, there exists an integer <math>N_T</math> such that T cannot prove the values of BB(n) for any <math>n \ge N_T</math>. Let <math>N_T</math> denote the least such integer. For [[wikipedia:Zermelo–Fraenkel_set_theory|Zermelo–Fraenkel set theory]] (ZF), this value is known to be in the range:
For any recursively enumerable and arithmetically sound axiomatic theory T, there exists an integer <math>N_T</math> such that T cannot prove the values of BB(n) for any <math>n \ge N_T</math>. Let <math>N_T</math> denote the least such integer. For [[wikipedia:Zermelo–Fraenkel_set_theory|Zermelo–Fraenkel set theory]] (ZF), this value is known to be in the range:


<math display="block">6 \le N_{ZF} \le 209</math>
<math display="block">6 \le N_{ZF} \le 207</math>


This lower bound comes from the fact that [[BB(5)]] has been proven in Rocq.<ref group="footnote">The fact that this theorem has been proven in Rocq technically does not imply that the theorem must be provable in ZF, because the consistency strength of Rocq is actually higher than that of ZF. However, the BB(5) proof does not use any techniques that could not be formalized within ZF.</ref> The upper bound comes from an explicit TM which halts if and only if ZFC has a finite proof of contradiction. Assuming ZF is consistent and sound, then it cannot prove whether or not it is consistent, hence it cannot prove whether or not this specific TM halts.
This lower bound comes from the fact that [[BB(5)]] has been proven in Rocq.<ref group="footnote">The fact that this theorem has been proven in Rocq technically does not imply that the theorem must be provable in ZF, because the consistency strength of Rocq is actually higher than that of ZF. However, the BB(5) proof does not use any techniques that could not be formalized within ZF.</ref> The upper bound comes from an explicit TM which halts if and only if ZFC has a finite proof of contradiction. Assuming ZF is consistent and sound, then it cannot prove whether or not it is consistent, hence it cannot prove whether or not this specific TM halts.
Line 17: Line 17:
! Upper bound on <math>N_T</math> (states)
! Upper bound on <math>N_T</math> (states)
|-
|-
| rowspan="7" |Set Theory
| rowspan="12" |Set Theory
| ZFC+I3
| ZF+Berkeley cardinal
| 1399
|-
| ZFC+I0
| 470 [https://discord.com/channels/960643023006490684/960643023530762341/1573072665860771992]
|-
| ZFC+I1
|
|-
| ZFC+I2
|
|
|-
|-
| ZF+Berkeley cardinal
| ZFC+I3
| 1399
| 486 [https://discord.com/channels/960643023006490684/960643023530762341/1573072665860771992]
|-
|-
| ZF+subtle cardinal
| ZF+subtle cardinal
| 493
| 493
|-
| NBG
|
|-
|-
| Zermelo-Fraenkel set theory (ZF) / ZFC
| Zermelo-Fraenkel set theory (ZF) / ZFC
| 209
| 207
|-
|-
| New Foundations + Axiom of Counting
| New Foundations (NF) + Axiom of Counting (AxCount)
| 201[https://github.com/wlad-svennik/notes/releases/tag/counting201-zermelo]
| 192[https://github.com/wlad-svennik/notes/tree/main/nf-axcount-bb192]
|-
|-
| Zermelo set theory
| Zermelo set theory
| 209 (via ZF)<ref group="footnote">Zermelo set theory is a subtheory of ZF. For the version with Choice, the same upper bound follows from inclusion in ZFC and [[#Axiom of Choice|the equality of the ZF and ZFC thresholds]].</ref>
| 192 (via NF+AxCount)<ref group="footnote">The 192-state NF + AxCount machine also gives <math>N_Z\le 192</math> for Zermelo set theory. Writing <math>H</math> for its blank-tape halting statement, the note proves <math>\mathrm{PA}\vdash\neg H\to\mathrm{Con}(Z)</math>. Thus, if <math>Z</math> is consistent, it cannot prove that the machine runs forever. The note derives actual nonhalting in ZF using the cited consistency comparisons. Proof and verification files</ref>
201 (via NF+AxCount)<ref group="footnote">The 201-state NF + AxCount machine also gives <math>N_Z\le 201</math> for Zermelo set theory. Writing <math>H</math> for its blank-tape halting statement, the note proves <math>\mathrm{PA}\vdash\neg H\to\mathrm{Con}(Z)</math>. Thus, if <math>Z</math> is consistent, it cannot prove that the machine runs forever. The note derives actual nonhalting in ZF using the cited consistency comparisons. Proof and verification files</ref>
|-
|-
| New Foundations (NF) / Mac Lane
| New Foundations (NF) / Mac Lane
| 192
| 185
|-
| KP
|
|-
| rowspan="10" |Arithmetic
| <math>\mathrm{Z}_\omega</math>
|
|-
| <math>\mathrm{Z}_2</math>
|
|-
|-
| rowspan="8" |Arithmetic
| Peano arithmetic (PA)
| Peano arithmetic (PA)
| 196 (direct)<br />192 (via NF)<ref group="footnote">The 192-state bound also applies to every weaker arithmetic theory listed below PA, since any numerical upper bound on <math>BB(n)</math> provable in one of those theories is also provable in PA. See [[Logical independence#Peano Arithmetic (PA)|the PA section]] for the proof of the 192-state bound.</ref>
| 196 (direct)<br />185 (via NF)<ref group="footnote">The 185-state bound also applies to every weaker arithmetic theory listed below PA, since any numerical upper bound on <math>BB(n)</math> provable in one of those theories is also provable in PA. See [[Logical independence#Peano Arithmetic (PA)|the PA section]] for the proof of the 185-state bound.</ref>
|-
|-
| PRA / <math>I\Sigma_1</math> / <math>\mathrm{RCA}_0</math> / <math>\mathrm{WKL}_0</math>
| PRA / <math>I\Sigma_1</math> / <math>\mathrm{RCA}_0</math> / <math>\mathrm{WKL}_0</math>
Line 179: Line 199:
|[[Media:K211-paper.pdf|Paper]]
|[[Media:K211-paper.pdf|Paper]]
|[[Media:K211-review-by-email.zip|Lean proof and replay]]
|[[Media:K211-review-by-email.zip|Lean proof and replay]]
|-
|207
|19 Nov 2026
|James Chang formalized with ChatGPT
|
|[https://github.com/jamesyc/BusyBeaver/tree/main/ZF207 Lean proof and replay]
|}
|}
[[File:ZFC Machine 254.png|thumb|The transition table of the ZF machine with 254 states. The initial state is 1.]]
[[File:ZFC Machine 254.png|thumb|The transition table of the ZF machine with 254 states. The initial state is 1.]]
Line 211: Line 237:
|
|
|[https://github.com/wlad-svennik/notes/releases/tag/nf192-countdown]
|[https://github.com/wlad-svennik/notes/releases/tag/nf192-countdown]
|-
|185
|19 November 2026
|@wlad-svennik
|[https://github.com/wlad-svennik/notes/tree/bfc960b0725ecab9be07518cc35954662f2592e7/nf-bb185/pa Github]
|[https://github.com/wlad-svennik/notes/tree/bfc960b0725ecab9be07518cc35954662f2592e7/nf-bb185/pa Lean verification on Github] (currently a 20MB tarball)
|}
|}


Line 250: Line 282:




If we add the ''Axiom of Counting'' (AxCount) to NF, which is the rather tautological-looking axiom<blockquote><nowiki>For any finite set S, |S| = |{{x}</nowiki> : x ∈ S}|      (i.e. the number of elements of S doesn't change when you replace each element x with the singleton {x})</blockquote>then it's sufficient to prove Con(Z). As of the time of this writing (November 2026) we've used this to obtain a machine that is smaller (201 states) than any machine of Zermelo-strength or above.
If we add the ''Axiom of Counting'' (AxCount) to NF, which is the rather tautological-looking axiom<blockquote><nowiki>For any finite set S, |S| = |{{x}</nowiki> : x ∈ S}|      (i.e. the number of elements of S doesn't change when you replace each element x with the singleton {x})</blockquote>then it's sufficient to prove Con(Z). As of the time of this writing (November 2026) we've used this to obtain a machine that is smaller (192 states) than any machine of Zermelo-strength or above.


ZFC can prove Con(NF + AxCount).
ZFC can prove Con(NF + AxCount).
Line 303: Line 335:
In particular, <math>K(x)y=x</math> follows immediately from axiom 1. It is not a separate axiom.
In particular, <math>K(x)y=x</math> follows immediately from axiom 1. It is not a separate axiom.


==== The 201-state machine for NF with the Axiom of Counting ====
==== With Rosser's Axiom of Counting ====
The 201-state machine uses the same three primitives. In the six-axiom calculus above, <math>b</math> serves both as ⊤ and is meant to satisfy axiom 2. By contrast, the Counting variant uses <math>qq</math> for ⊤, and makes ''<math>b</math>'' honour axiom 2 by defining <math>b:=(rq)q</math>. The definitions <math>K(x):=H(x,x)</math> and <math>r:=(qq)q</math> carry over.<ref>[https://github.com/wlad-svennik/notes/releases/tag/counting201-zermelo ''A 201-state Busy Beaver bound for Zermelo set theory''], proof and verification files.</ref>
The 196-state machine uses the same three primitives. In the six-axiom calculus above, <math>b</math> serves both as ⊤ and is meant to satisfy axiom 2. By contrast, the Counting variant uses <math>qq</math> for ⊤, and makes ''<math>b</math>'' honour axiom 2 by defining <math>b:=(rq)q</math>. The definitions <math>K(x):=H(x,x)</math> and <math>r:=(qq)q</math> carry over.<ref>[https://github.com/wlad-svennik/notes/releases/tag/counting201-zermelo ''A 201-state Busy Beaver bound for Zermelo set theory''], proof and verification files.</ref>


With this definition of <math>b</math>, axioms 1, 2, 4 and 5 carry over as written. Replacing axioms 3 and 6 and adding axiom 7 gives the following changes. All free variables are universally quantified.
With this definition of <math>b</math>, axioms 1, 2, 4 and 5 carry over as written. Replacing axioms 3 and 6 and adding axiom 7 gives the following changes. All free variables are universally quantified.
Line 324: Line 356:
|Counting
|Counting
|}
|}
Thus <math>r</math> has two roles. It is the value returned by a failed fixed-point test, and it is the operator in the Counting axiom. To read axiom 7, put <math>a=rx</math>. The axiom then says that for every <math>a</math> in the range of <math>r</math>, applying <math>ra</math> to the fixed argument <math>q</math> recovers <math>a</math>.
Thus <math>r</math> has two roles. It serves as ⊥, and it is the operator in the Counting axiom. To read axiom 7, put <math>a=rx</math>. The axiom then says that for every <math>a</math> in the range of <math>r</math>, applying <math>ra</math> to the fixed argument <math>q</math> recovers <math>a</math>.


=== Fragment of First-Order Logic ===
=== Fragment of First-Order Logic ===
Notably, we '''do not''' implement the whole of First-Order Logic: The quantifier ∀ can be defined ''internally'' to CombNF / FunctionalNF. Moreover, we don't even implement variables thanks to our use of combinatory logic. The only fragment of First-Order Logic we do implement consists of "=", the above function symbols, and propositional logic. This is similar to [https://en.wikipedia.org/wiki/primitive_recursive_arithmetic Primitive Recursive Arithmetic] and [https://en.wikipedia.org/wiki/system_T System T].
Notably, we '''do not''' implement the whole of First-Order Logic: The quantifier ∀ can be defined ''internally'' to CombNF / FunctionalNF:<blockquote>∀ := λP.(P ≐ λx.⊤)
 
Observe that:<blockquote>∀ := λP.(P ≐ λx.⊤)


¬ := λp.(p ≐ ⊥)
¬ := λp.(p ≐ ⊥)


∃ := λP. ¬ (∀ λx. ¬ (P x))</blockquote>
∃ := λP. ¬ (∀ λx. ¬ (P x))</blockquote>Moreover, we've avoided implementing variables thanks to our use of combinatory logic. The only fragment of First-Order Logic we ''do'' implement consists of "=", the above function symbols, and propositional logic. This is similar to [[wikipedia:primitive_recursive_arithmetic|Primitive Recursive Arithmetic]] and [[wikipedia:system_T|System T]].


=== What the symbols do ===
=== What the symbols do ===
Line 388: Line 418:
This machine takes Wade's ZF champion and replaces the set theory axioms with one axiom schema of "adjunction + separation", which has been shown to interpret PA.<ref>https://mathoverflow.net/questions/508137/interpreting-pa-with-only-adjunction-separation/508161</ref>
This machine takes Wade's ZF champion and replaces the set theory axioms with one axiom schema of "adjunction + separation", which has been shown to interpret PA.<ref>https://mathoverflow.net/questions/508137/interpreting-pa-with-only-adjunction-separation/508161</ref>


The 192-state machine halts exactly when NF proves a contradiction.<ref>[https://github.com/wlad-svennik/notes/releases/tag/nf192-countdown New Foundations: 192-state countdown machine and Lean verification].</ref> The Holmes–Wilshaw consistency proof for NF therefore establishes in ZFC that the machine runs forever.<ref>M. Randall Holmes and Sky Wilshaw, [https://arxiv.org/abs/1503.01406 ''NF is Consistent''].</ref> For this same machine, PA proves that if it runs forever, then PA is consistent.<ref>[https://github.com/wlad-svennik/notes/releases/tag/nf192-pa A 192-state Busy Beaver bound for Peano arithmetic], theorem <code>PA192.PhysicalModel.Frozen.internal_consistency</code>.</ref> By Gödel's second incompleteness theorem, PA cannot prove that it runs forever. If PA proved a numerical upper bound on <math>BB(192)</math>, it could verify that the machine survives that many steps and hence prove that it runs forever. Thus <math>N_{\mathrm{PA}}\leq 192</math>.
The 185-state machine halts exactly when NF proves a contradiction.<ref>https://github.com/wlad-svennik/notes/tree/bfc960b0725ecab9be07518cc35954662f2592e7/nf-bb185/pa</ref> The Holmes–Wilshaw consistency proof for NF therefore establishes in ZFC that the machine runs forever.<ref>M. Randall Holmes and Sky Wilshaw, [https://arxiv.org/abs/1503.01406 ''NF is Consistent''].</ref> For this same machine, PA proves that if it runs forever, then PA is consistent.<ref>https://github.com/wlad-svennik/notes/tree/bfc960b0725ecab9be07518cc35954662f2592e7/nf-bb185/pa</ref> By Gödel's second incompleteness theorem, PA cannot prove that it runs forever. If PA proved a numerical upper bound on <math>BB(185)</math>, it could verify that the machine survives that many steps and hence prove that it runs forever. Thus <math>N_{\mathrm{PA}}\leq 185</math>.


=== Weaker arithmetical theories ===
=== Weaker arithmetical theories ===

Latest revision as of 02:46, 20 November 2026

For any recursively enumerable and arithmetically sound axiomatic theory T, there exists an integer NT such that T cannot prove the values of BB(n) for any n≥NT. Let NT denote the least such integer. For Zermelo–Fraenkel set theory (ZF), this value is known to be in the range:

6≤NZF≤207

This lower bound comes from the fact that BB(5) has been proven in Rocq.[footnote 1] The upper bound comes from an explicit TM which halts if and only if ZFC has a finite proof of contradiction. Assuming ZF is consistent and sound, then it cannot prove whether or not it is consistent, hence it cannot prove whether or not this specific TM halts.

Harvey Friedman spoke of embedding consistency statements within turing machines in a 2004 posting on the "Foundations of Mathematics" mailing list. Scott Aaronson conjectured in his Busy Beaver Frontier survey that NZF≤20 and NPA≤10, where PA refers to the theory of Peano Arithmetic. Scott also mentioned (crediting Oscar Cunningham for the observation) that if there is an n-state machine that halts if and only if T is inconsistent, then PA + “BB(n) = b” can prove the consistency of T, where b is the true value of BB(n).[1]

Results by Theory

Most normal theories form a linear ordering with respect to consistency strength. All theories in the table below follow that linear order from top to bottom. Thus for any row X below Y, NX≤NY. Rows are empty if no better results is known than the result inherited from a previous row.

Note: For extremely weak theories, NT is not well defined without defining a specific TM encoding. Technically, NT for any theory requires fixing some TM encoding into the language of the theory. But for EFA and stronger theories, they are strong enough to prove the equivalence between all common TM encodings (ex: binary, beta-function, prime-power, MRDP), so specifying the precise encoding is generally irrelevant. Below EFA, the prime-power encoding cannot be decoded due to exponentiation not being provably total.

Language Theory Upper bound on NT (states)
Set Theory ZF+Berkeley cardinal 1399
ZFC+I0 470 [1]
ZFC+I1
ZFC+I2
ZFC+I3 486 [2]
ZF+subtle cardinal 493
NBG
Zermelo-Fraenkel set theory (ZF) / ZFC 207
New Foundations (NF) + Axiom of Counting (AxCount) 192[3]
Zermelo set theory 192 (via NF+AxCount)[footnote 2]
New Foundations (NF) / Mac Lane 185
KP
Arithmetic Zω
Z2
Peano arithmetic (PA) 196 (direct)
185 (via NF)[footnote 3]
PRA / IΣ1 / RCA0 / WKL0
EA+
EFA
IΔ0+Ω1 / S2
T21 / S22
PV1 / S21
IΔ0

Axiom of Choice

Due to Shoenfield's absoluteness theorem, it is known that any TM proven non-halting in ZFC can also be proven non-halting in ZF (and the converse is trivially true), therefore

NZFC=NZF

Therefore we refer to ZF and NZF throughout this article since adding the Axiom of Choice does not have any effect on Turing machine decidability.

History

In a broad sense, the concept of a mechanical or computable procedure that was equivalent to the consistency of a formal theory was discovered by Kurt Gödel's incompleteness theorem, which is notable for introducing a meta-mathematical encoding of the statement that "T can prove statement S" (the provability predicate) which is used in all these machines. This was further clarified by Alan Turing and Alonzo Church's work on a formal definition of computability.

Although not a traditional turing machine, in 2012 Merlin Carl and Boris Z. Moroz constructed a Diophantine Equation which had solutions if and only if NBG (Von Neumann–Bernays–Gödel set theory) is inconsistent. NBG is a conservative extension of ZFC, so solving this equation is independent of ZFC.[2]

Zermelo–Fraenkel set theory (ZF)

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. The results before 2026 are taken from Scott Aaronson's blog announcements and Busy Beaver Frontier or self-reported by the individuals who discovered them. The Aaronson-Yedida machine used a compiler called Laconic, which was then updated with NQL or "Not Quite Laconic", while the 432 machines use a compiler built by Andrew J. Wade. Many machines after 2026 have been generated by AI without a formal compiler.

Note that only the results with a linked formal verification are known to have such a verification, with the 7910 machine in particular relying on a result from Harvey Friedman that has no published proof.

History of ZF independent TMs
States Date Discoverer Source Verification
7910 May 2016 Adam Yedidia and Scott Aaronson Yedidia and Aaronson 2016[3]
1919 15 May 2016 Stefan O'Rear Github NQL file, Metamath Group Announcement
748 May 2016 Stefan O’Rear Github NQL, Busy Beaver Frontier[1]
745 July 2023 Johannes Riebel Riebel 2023 Bachelor Thesis[4]
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)
549 16 July 2025 Andrew J. Wade Github NQL (commit)
432 19 Aug 2025 Andrew J. Wade git commit
335 11 Oct 2026 Jeff Ketchersid discord message
254 13 Oct 2026 Mira with use of ChatGPT, formalized by Jeff Ketchersid with Claude Github Rocq file
230 19 Oct 2026 Elliot Glazer with use of ChatGPT, formalized with GPT and Claude Github Rocq file
215 21 Oct 2026 Vladimir Reshetnikov formalized with Claude Github Rocq file
209 12 Nov 2026 James Chang formalized with ChatGPT Github(discord message) Lean
211 17 Nov 2026 Shivam Patel Paper Lean proof and replay
207 19 Nov 2026 James Chang formalized with ChatGPT Lean proof and replay
The transition table of the ZF machine with 254 states. The initial state is 1.

Wade's 432-state champion also omits the axiom of regularity, as ZF-regularity is also equiconsistent with ZF.

New Foundations (NF)

New Foundations is a formal theory created by W.V.O. Quine in 1937, based around the principle of stratified comprehension of sets. It is known to be stronger than Peano Arithmetic and second-order arithmetic, but weaker than ZF. The Github page contains a proof in Lean that it is equiconsistent with Mac Lane set theory, which is a novel result as of the time of writing (November 2026). Mac Lane set theory is far more mainstream than NF, so the following machine could be seen as an efficient way of determining which Busy Beaver value MAC cannot verify.

History of New Foundations (NF) independent TMs
States Date Discoverer Source Verification
210 8 November 2026 @wlad-svennik [4]
198 12 November 2026 @wlad-svennik [5]
192 16 November 2026 @wlad-svennik [6]
185 19 November 2026 @wlad-svennik Github Lean verification on Github (currently a 20MB tarball)

User-friendly theory

The TM searches for an inconsistency in the theory "FunctionNF". It is defined to equal stratified λ-calculus minus pairing, minus case-expressions, plus full functional extensionality, plus an equality checker.

Terms     t ::= x | t u | λx.t | (s ≐ t) | ⊤ | ⊥

Depth     Each subterm occurrence has a depth relative to the term it sits in:
            the term itself        0
            in  t u   at depth n:  t at n+1,  u at n
            in  λx.t  at depth n:  t at n−1
            in  s ≐ t at depth n:  s and t at n

Formation λx.t is a term iff every free occurrence of x in t has depth 0 in t.
          Nothing else is constrained: other variables may occur at any depths.

Axioms    (β)    (λx.t) u = t[u/x]
          (ext)  (∀x. f x = g x) → f = g
          (≐)    s = t → (s ≐ t) = ⊤        s ≠ t → (s ≐ t) = ⊥
          (nt)   ⊤ ≠ ⊥

The logic is ordinary first-order logic with equality, so unstratified formulas are allowed. Only λ is restricted.

It's not obvious, but the above suffices to prove the Axiom of Infinity, i.e. that the set of natural numbers exists and has all of its expected properties. It's then possible to define the set of real numbers in any of the usual ways, and do nearly all of extant mathematics.

NF vs Mac Lane vs other set theories

The Github link contains proofs in Lean that:

  • NF interprets FunctionNF (which is very short),
  • FunctionNF in turn interprets NFU+Infinity (which is similar to Specker's proof of the "Axiom of Infinity" within NF),
  • NFU+Infinity interprets NF, which is a novel and hard result that is not yet found in the literature,
  • NFU+Infinity interprets Mac Lane set theory,
  • Mac Lane set theory interprets TSTI (Theory of Simple Types plus (Axiom of) Infinity),
  • TSTI is equiconsistent with NFU+Infinity.

So overall, the machine halts iff there exists an inconsistency in any of the above theories. Regardless, Mac Lane set theory is actually weaker than NF in terms of intepretability strength, as opposed to just consistency strength.

With Rosser's Axiom of Counting

If we add the Axiom of Counting (AxCount) to NF, which is the rather tautological-looking axiom

For any finite set S, |S| = |{{x} : x ∈ S}| (i.e. the number of elements of S doesn't change when you replace each element x with the singleton {x})

then it's sufficient to prove Con(Z). As of the time of this writing (November 2026) we've used this to obtain a machine that is smaller (192 states) than any machine of Zermelo-strength or above.

ZFC can prove Con(NF + AxCount).

Implementation theory: The combinatory calculus

FunctionalNF is not implemented directly. Instead, a massively leaner form is implemented, in the form of a combinatory logic which consists of just three nonlogical primitives:

  • Binary application xy, associated to the left.
  • A constant q. This is a fixed-point tester.
  • A binary function H(x,y). This is a merger between the K combinator and a Skolem function for function extensionality.

Define the convenient shorthands

K(x):=H(x,x),r:=(qq)q,b:=(q(qq))r.

The six axioms, with all free variables universally quantified, are:

No. Axiom Role
1 H(x,x)y=x Constant functions
2 bxyz=(xH(z,z))(yz) Combinatory composition
3 xy=y⟹(qx)y=b Positive equality test
4 xy≠y⟹(qx)y=r Negative equality test
5 xH(x,y)=yH(x,y)⟹x=y Extensionality witness
6 q(qq)≠qq Nondegeneracy

In particular, K(x)y=x follows immediately from axiom 1. It is not a separate axiom.

With Rosser's Axiom of Counting

The 196-state machine uses the same three primitives. In the six-axiom calculus above, b serves both as ⊤ and is meant to satisfy axiom 2. By contrast, the Counting variant uses qq for ⊤, and makes b honour axiom 2 by defining b:=(rq)q. The definitions K(x):=H(x,x) and r:=(qq)q carry over.[5]

With this definition of b, axioms 1, 2, 4 and 5 carry over as written. Replacing axioms 3 and 6 and adding axiom 7 gives the following changes. All free variables are universally quantified.

No. Axiom Role
3 xy=y⟹(qx)y=qq Positive fixed-point test
6 qq≠q Nondegeneracy. The machine halts if it derives qq=q.
7 (r(rx))q=rx Counting

Thus r has two roles. It serves as ⊥, and it is the operator in the Counting axiom. To read axiom 7, put a=rx. The axiom then says that for every a in the range of r, applying ra to the fixed argument q recovers a.

Fragment of First-Order Logic

Notably, we do not implement the whole of First-Order Logic: The quantifier ∀ can be defined internally to CombNF / FunctionalNF:

∀ := λP.(P ≐ λx.⊤)

¬ := λp.(p ≐ ⊥)

∃ := λP. ¬ (∀ λx. ¬ (P x))

Moreover, we've avoided implementing variables thanks to our use of combinatory logic. The only fragment of First-Order Logic we do implement consists of "=", the above function symbols, and propositional logic. This is similar to Primitive Recursive Arithmetic and System T.

What the symbols do

q is an equality tester:

(qx)y={b,xy=y,r,xy≠y.

H has two jobs. On the diagonal it constructs constant functions:

H(x,x)y=x.

Off the diagonal it supplies a witness to distinguish two functions whenever they are different:

x≠y⟹xH(x,y)≠yH(x,y).

b supplies the composition law

bxyz=x(K(z))(yz).

Here b and r are terms, not primitive constants.

Once again, we do not implement the whole of First-Order Logic.

The formalized proof for this machine's NF-undecidability is formalized as an external Lean metatheorem rather than a completed PA-internal derivation. As of this publication, a fresh independent clean build and community review have not been reported.

Peano Arithmetic (PA)

The ZF bound applies to PA because ZF proves the arithmetical theorems of PA. In turn, a proof of an exact Busy Beaver value in any theory listed below PA would give a PA proof of that same value. For n≥196, a proof of BB(n)=b would let PA decide whether the 196-state machine halts by padding it to n states and checking its first b steps.

History of Peano Arithmetic (PA) independent TMs
States Date Discoverer Source Verification
372 11 February 2026 @LegionMammal978 (Matthew House) Github
196 12 Nov 2026 James Chang formalized with ChatGPT Github Lean

This machine takes Wade's ZF champion and replaces the set theory axioms with one axiom schema of "adjunction + separation", which has been shown to interpret PA.[6]

The 185-state machine halts exactly when NF proves a contradiction.[7] The Holmes–Wilshaw consistency proof for NF therefore establishes in ZFC that the machine runs forever.[8] For this same machine, PA proves that if it runs forever, then PA is consistent.[9] By Gödel's second incompleteness theorem, PA cannot prove that it runs forever. If PA proved a numerical upper bound on BB(185), it could verify that the machine survives that many steps and hence prove that it runs forever. Thus NPA≤185.

Weaker arithmetical theories

Even R0, a proper subtheory of Tarski–Mostowski–Robinson R, proves every true individual halting assertion because it proves all true Σ1 sentences in the usual language of arithmetic.[10] Between Robinson arithmetic Q and bounded induction IΔ0 lie PA−, the theory of discretely ordered semirings, and IOpen, which adds induction for quantifier-free formulas.[11] Further up, EA+ adds total superexponentiation to EFA. It proves the consistency of IΔ0, which EFA cannot prove.[12]

Theories grouped in one arithmetic row have the same Busy Beaver threshold. For fixed standard n and b, a counterexample to BB(n)≤b is a halting computation of an n-state machine lasting more than b steps. A proposed computation can be checked in polynomial time in the length of its complete history. When BB(n)=b is true, a particular halting run witnesses the matching lower bound.

With this explicit history coding, PV1 and S21 agree on the universal equations expressing the upper bounds. Full bounded arithmetic S2 and IΔ0+Ω1 agree on sentences in their common arithmetical language.[13] Buss's conservation theorem similarly gives T21 and S22 the same provable upper bounds.[14] Finally, IΣ1, RCA0 and WKL0 agree with PRA on Π20 arithmetic sentences, which suffices for all four to share a threshold.[15]

Large cardinals

These tables are for theories stronger than ZFC.

History of ZFC + "There exist arbitrarily large subtle cardinals" independent TMs
States Date Discoverer Source Verification
493 25 February 2026 @LegionMammal978 Github

This machine takes Wade's ZF champion and adds the axiom of Choice and a statement from Harvey Friedman (Proposition 4.3 of "Primitive Independence Results")[16] which Friedman showed to be equivalent to "There exist arbitrarily large subtle cardinals" over ZFC.

For reference, this theory is between the strength of "strongly unfoldable" and "0♯ exists" on the large cardinal hierarchy on Wikipedia.

Note: The initial machine produced in 2016 by Yedidia and Aaronson is designed to halt iff a certain statement created by Harvey Friedman is true.[1] According to Friedman (without a published proof), this statement is independent of the theory "Stationary Ramsey Property" or SRP, which is equiconsistent with the theory ZFC+{``There is a k-subtle cardinal``∣k∈ℕ} which is also between the strength of "strongly unfoldable" and "0♯ exists" on the large cardinal hierarchy.[17] However, the theory used by the BB(493) machine is also independent of this theory.

History of ZF + "There exists a Berkeley cardinal" independent TMs
States Date Discoverer Source Verification
1399 8 November 2026 @Meganeuridae Github Rocq file

Berkeley cardinals are perhaps the strongest family of large cardinals considered, initially proposed by Hugh Woodin at a lecture at UC Berkeley as an axiom that was "obviously inconsistent".[citation needed] However, no inconsistency has been found and many people now believe it may be consistent. Berkeley cardinals are known to be inconsistent with the axiom of choice.

Footnotes

  1. ↑ The fact that this theorem has been proven in Rocq technically does not imply that the theorem must be provable in ZF, because the consistency strength of Rocq is actually higher than that of ZF. However, the BB(5) proof does not use any techniques that could not be formalized within ZF.
  2. ↑ The 192-state NF + AxCount machine also gives NZ≤192 for Zermelo set theory. Writing H for its blank-tape halting statement, the note proves PA⊢¬H→Con(Z). Thus, if Z is consistent, it cannot prove that the machine runs forever. The note derives actual nonhalting in ZF using the cited consistency comparisons. Proof and verification files
  3. ↑ The 185-state bound also applies to every weaker arithmetic theory listed below PA, since any numerical upper bound on BB(n) provable in one of those theories is also provable in PA. See the PA section for the proof of the 185-state bound.

References

  1. ↑ 1.0 1.1 1.2 Scott Aaronson. 2020. The Busy Beaver Frontier. SIGACT News 51, 3 (August 2020), 32–54. https://doi.org/10.1145/3427361.3427369
  2. ↑ Carl, M., & Moroz, B. Z. (2012). On a Diophantine representation of the predicate of provability. Zapiski Nauchnykh Seminarov POMI, 407, 77-104. (Republished in 2014 in the Journal of Mathematical Sciences) (preprint)
  3. ↑ 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
  4. ↑ Riebel, Johannes (March 2023). The Undecidability of BB(748): Understanding Gödel's Incompleteness Theorems (PDF) (Bachelor's thesis). University of Augsburg.
  5. ↑ A 201-state Busy Beaver bound for Zermelo set theory, proof and verification files.
  6. ↑ https://mathoverflow.net/questions/508137/interpreting-pa-with-only-adjunction-separation/508161
  7. ↑ https://github.com/wlad-svennik/notes/tree/bfc960b0725ecab9be07518cc35954662f2592e7/nf-bb185/pa
  8. ↑ M. Randall Holmes and Sky Wilshaw, NF is Consistent.
  9. ↑ https://github.com/wlad-svennik/notes/tree/bfc960b0725ecab9be07518cc35954662f2592e7/nf-bb185/pa
  10. ↑ Taishi Kurahashi and Albert Visser, Certified Σ₁-Sentences, §2, Theorem 2.3.
  11. ↑ Kazuyuki Tanaka, Logic and Computation I, Part 3a. Formal Arithmetic, Corollary 3.43.
  12. ↑ Samuel R. Buss, First-Order Proof Theory of Arithmetic, §4.3.
  13. ↑ Jan Krajíček, Bounded Arithmetic, Propositional Logic, and Complexity Theory, Lemma 5.2.15 and Theorem 5.3.4.
  14. ↑ Samuel R. Buss, Axiomatizations and Conservation Results for Fragments of Bounded Arithmetic.
  15. ↑ Jeremy Avigad, Notes on Π¹₁-conservativity, ω-submodels, and the collection schema, §2.
  16. ↑ H. Friedman, "Primitive Independence Results" (2002). Accessed February 2026.
  17. ↑ tlonuqbar, "What is the consistency strength of SRP (Stationary Ramsey Property)?" (2026). MathOverflow post, accessed February 2026.