Enumeration: Difference between revisions
Jump to navigation
Jump to search
→List of enumeration scripts: Created enumerators table. |
m →List of enumeration scripts: Renamed |
||
| (5 intermediate revisions by 2 users not shown) | |||
| Line 8: | Line 8: | ||
!File Name | !File Name | ||
!Language | !Language | ||
|- | |||
|Branching Turing Machine | |||
|[https://github.com/sligocki/etc/blob/main/bb_tri/src/enumerator.rs https://github.com/sligocki/etc] | |||
|<code>bb_tri/scr/enumerator.rs</code> | |||
|Rust | |||
|- | |- | ||
|CounterScript | |CounterScript | ||
| Line 13: | Line 18: | ||
|<code>main.js</code> | |<code>main.js</code> | ||
|JavaScript | |JavaScript | ||
|- | |||
|CounterScript | |||
|https://github.com/sligocki/etc | |||
|<code>bbcs/src/enumerator.rs</code> | |||
|Rust | |||
|- | |- | ||
|Fractran | |Fractran | ||
|https://github.com/int-y1/BBFractran | |https://github.com/int-y1/BBFractran | ||
|<code>fractran20260416.cpp</code> | |<code>enumerate/fractran20260416.cpp</code> | ||
|C++ | |C++ | ||
|- | |||
|General Recursive Function | |||
|https://github.com/sligocki/etc | |||
|<code>gen_rec/scr/enumerate.rs</code> | |||
|Rust | |||
|- | |||
|Lambda Calculus | |||
|[https://github.com/tromp/AIT/blob/master/BB/BB.lhs https://github.com/tromp/AIT] | |||
|<code>BB/BB.lhs</code> | |||
|Haskell | |||
|- | |||
|Post Tag | |||
|[https://github.com/sligocki/etc/blob/main/bb_tri/src/enumerator.rs https://github.com/sligocki/etc] | |||
|<code>post_tag/src/enumerate.rs</code> | |||
|Rust | |||
|- | |- | ||
|Register Machine | |Register Machine | ||
| Line 26: | Line 51: | ||
|Turing Machine | |Turing Machine | ||
|https://github.com/sligocki/busy-beaver | |https://github.com/sligocki/busy-beaver | ||
|<code>Enumerate.py</code> | |<code>Code/Enumerate.py</code> | ||
|Python | |Python | ||
|- | |||
|Turing Machine | |||
|https://github.com/ccz181078/TM | |||
|<code>main.cpp</code> | |||
|C++ | |||
|} | |} | ||
Latest revision as of 09:31, 22 August 2026
Enumeration is the process of generating all candidate Turing machines (or other program types) within a given domain potentially filtered modulo isomorphism (ex: TNF). These enumerations can then be filtered down by deciders leaving a list of holdouts which remain undecided.
List of enumeration scripts
| System | Repository | File Name | Language |
|---|---|---|---|
| Branching Turing Machine | https://github.com/sligocki/etc | bb_tri/scr/enumerator.rs
|
Rust |
| CounterScript | https://github.com/AzertyWasTaken/CounterScript | main.js
|
JavaScript |
| CounterScript | https://github.com/sligocki/etc | bbcs/src/enumerator.rs
|
Rust |
| Fractran | https://github.com/int-y1/BBFractran | enumerate/fractran20260416.cpp
|
C++ |
| General Recursive Function | https://github.com/sligocki/etc | gen_rec/scr/enumerate.rs
|
Rust |
| Lambda Calculus | https://github.com/tromp/AIT | BB/BB.lhs
|
Haskell |
| Post Tag | https://github.com/sligocki/etc | post_tag/src/enumerate.rs
|
Rust |
| Register Machine | https://github.com/int-y1/BBFractran | rm.cpp
|
C++ |
| Turing Machine | https://github.com/sligocki/busy-beaver | Code/Enumerate.py
|
Python |
| Turing Machine | https://github.com/ccz181078/TM | main.cpp
|
C++ |