Skip to content

NF + AxCount in 197 states

Choose a tag to compare

@wlad-svennik wlad-svennik released this 19 Nov 15:18
· 4 commits to main since this release
43ba3de

The two-symbol Turing machine has 197 working states, 394 transitions and a separate halt state. On a blank tape it halts exactly when the ten-row Counting calculus derives its target equality.

For every formula, the 197-state search has a proof word exactly when the 199-state search does. The Lean theorem is Counting197.same_buildable_conclusions_199. The verification archive includes the Lean sources, replay instructions and an independent full-tape check at all 3,443 register instructions.

NF_AxCount_197.tm is the transition table. To reproduce the checks, extract NF_AxCount_197_Verification.zip and follow its README.