Closed Position Set (CPS): Difference between revisions
Jump to navigation
Jump to search
(Created page with "TODO") |
(Used Template:Stub) |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
{{Stub}} | |||
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 == | |||
* [https://gist.github.com/savask/1c43a0e5cdd81229f236dcf2b0611c3f The closed position set decider, reverse-engineered from Skelet's program]: savask's Oct 2022 Haskell implementation of CPS with extensive descriptive comments. | |||
* [https://github.com/Nathan-Fenner/bb-simple-n-gram-cps bb-simple-n-gram-cps]: Nathan Fenner's n-gram CPS description and code | |||
* [https://discuss.bbchallenge.org/t/thoughts-on-closed-position-set/116 Thoughts on Closed Position Set]: Shawn Ligocki's investigation into the connection with CTL (regular languages). | |||
== Implementations == | |||
Traditional CPS: | |||
* [https://gist.github.com/savask/1c43a0e5cdd81229f236dcf2b0611c3f Turing.hs]: in Haskell by savask | |||
* [https://github.com/univerz/bbc/blob/skelet-cps/src/skelet_cps.rs skelet_cps.rs] in Rust by Pavel Kropitz | |||
* [https://github.com/sligocki/busy-beaver/blob/main/Code/CPS.py CPS.py] in Python by Shawn Ligocki | |||
* [https://gist.github.com/mateon1/b63eabc371ac35e2a14a9c5ce37413bc skeletcps.py] in Python by Mateon1 | |||
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/ccz181078/Coq-BB5/blob/main/CoqBB5/Deciders/Decider_NGramCPS.v Decider_NGramCPS.v] in Coq by mxdys | |||
[[Category:Deciders]] | |||
Latest revision as of 22:30, 10 August 2025
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
n-gram CPS:
- bb-simple-n-gram-cps in Rust by Nathan Fenner
- Decider_NGramCPS.v in Coq by mxdys