Repository navigation
This binary Turing machine has 196 working states and 392 transitions. On a blank tape it halts exactly when the original ten-row Counting calculus derives its target equality (code 3).
Moving a register read past the first implication saves one decoder state. Lean verifies that every 197-state proof word works unchanged and that the 196-state machine proves exactly the same conclusions as the 199-state machine.
Download the .tm file for the transition table. The verification ZIP includes the Lean sources, replay tools and instructions. The independent simulator passed 82,632 full-tape tests.
SHA-256
18ec8262ccf9a52101ea2152c40b30c97eab8fa1a259d3396d6c9719bf4b8662 NF_AxCount_196.tm
cc80e8e4666acc3f3e59c5c0d636cacac0e73b82a8a83a34959910762276d513 NF_AxCount_196_Verification.zip