Coq-BB5: Difference between revisions
→Deciders: description of Loop.v |
Linked deciders |
||
| Line 1: | Line 1: | ||
{{Stub}} | {{Stub}} | ||
'''Coq-BB5''' is a [https://en.wikipedia.org/wiki/Rocq Rocq] (previously known as Coq) proof that BB(5) = 47,176,870. It combines many deciders and individual TM proofs that the [[bbchallenge.org]] community developed and described over the years 2022-2024. It is maintained by mxdys and includes a snapshot of [[BusyCoq]] maintained by meithecatte. Coq-BB5 also contains proofs of the values of [[BB(2)]], [[BB(3)]], [[BB(4)]], [[BB(2,3)]] and [[BB(2,4)]]. | '''Coq-BB5''' is a [https://en.wikipedia.org/wiki/Rocq Rocq] (previously known as Coq) proof that BB(5) = 47,176,870. It combines many [[deciders]] and individual TM proofs that the [[bbchallenge.org]] community developed and described over the years 2022-2024. It is maintained by mxdys and includes a snapshot of [[BusyCoq]] maintained by meithecatte. Coq-BB5 also contains proofs of the values of [[BB(2)]], [[BB(3)]], [[BB(4)]], [[BB(2,3)]] and [[BB(2,4)]]. | ||
== Individual proofs == | == Individual proofs == | ||
Revision as of 14:34, 2 April 2026
Coq-BB5 is a Rocq (previously known as Coq) proof that BB(5) = 47,176,870. It combines many deciders and individual TM proofs that the bbchallenge.org community developed and described over the years 2022-2024. It is maintained by mxdys and includes a snapshot of BusyCoq maintained by meithecatte. Coq-BB5 also contains proofs of the values of BB(2), BB(3), BB(4), BB(2,3) and BB(2,4).
Individual proofs
The individual TM proofs are - except for Skelet 17 - all contained within the included snapshot of BusyCoq. TMs which have individual proofs in BusyCoq are: The "finned" machines (Finned #1 (proof), Finned #2 (proof), Finned #3 (proof), Finned #4 (proof) and Finned #5 (proof)) and Skelet machines 1 (proof), 10 (proof), 15 (proof), 26 (proof), 33 (proof), 34 (proof) and 35 (proof).[1] Coq-BB5 imports these proofs from BusyCoq. The individual proof of non-halting for Skelet 17 (proof)(description) is contained within Coq-BB5 itself.[2]
Deciders
- Halt.v
- Halt_BB5.v
- Loop.v, this decider simulates TMs for a fixed number of steps, checking for halting and Lin recurrence.
- NGramCPS.v, Coq-BB5 uses regular NGram CPS aswell as the Fixed-length history and Least Recent Usage history (LRU) augmentations.
- RepWL.v, see Repeated Word List for details.
See: https://github.com/ccz181078/Coq-BB5/tree/main
TODO: Give wiki links to these deciders and individual TM proofs.