Closed Position Set: Difference between revisions
Jump to navigation
Jump to search
m coq -> rocq |
→Implementations: linked NGram CPS |
||
| Line 16: | Line 16: | ||
* [https://gist.github.com/mateon1/b63eabc371ac35e2a14a9c5ce37413bc skeletcps.py] in Python by Mateon1 | * [https://gist.github.com/mateon1/b63eabc371ac35e2a14a9c5ce37413bc skeletcps.py] in Python by Mateon1 | ||
n-gram CPS: | [[NGram CPS|n-gram CPS]]: | ||
* [https://github.com/Nathan-Fenner/bb-simple-n-gram-cps bb-simple-n-gram-cps] in Rust by Nathan Fenner | * [https://github.com/Nathan-Fenner/bb-simple-n-gram-cps bb-simple-n-gram-cps] in Rust by Nathan Fenner | ||
Revision as of 21:08, 31 March 2026
Closed Position Set (CPS) is a Closed Set decider invented by Skelet and introduced to the bbchallenge.org community by savask. Since that introduction, there are many variations of the decider that have been used, notably "ngram CPS" which was used in the Coq-BB5 proof.
Information
- The closed position set decider, reverse-engineered from Skelet's program: savask's Oct 2022 Haskell implementation of CPS with extensive descriptive comments.
- bb-simple-n-gram-cps: Nathan Fenner's n-gram CPS description and code
- Thoughts on Closed Position Set: Shawn Ligocki's investigation into the connection with CTL (regular languages).
Implementations
Traditional CPS:
- Turing.hs: in Haskell by savask
- skelet_cps.rs in Rust by Pavel Kropitz
- CPS.py in Python by Shawn Ligocki
- skeletcps.py in Python by Mateon1
- bb-simple-n-gram-cps in Rust by Nathan Fenner
- Decider_NGramCPS.v in Rocq by mxdys