Enumeration: Difference between revisions
Jump to navigation
Jump to search
→List of enumeration scripts: Added more enumerator scripts. |
m →List of enumeration scripts: typo |
||
| Line 31: | Line 31: | ||
|General Recursive Function | |General Recursive Function | ||
|https://github.com/sligocki/etc | |https://github.com/sligocki/etc | ||
|<code> | |<code>gen_rec/scr/enumerate.rs</code> | ||
|Rust | |Rust | ||
|- | |- | ||
Revision as of 14:58, 18 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 Beaver | 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 |