Enumeration: Difference between revisions
Jump to navigation
Jump to search
→List of enumeration scripts: Created enumerators table. |
→List of enumeration scripts: added lambda calculus enumerator |
||
| Line 18: | Line 18: | ||
|<code>fractran20260416.cpp</code> | |<code>fractran20260416.cpp</code> | ||
|C++ | |C++ | ||
|- | |||
|Lambda Calculus | |||
|https://github.com/tromp/AIT/blob/master/BB/BB.lhs | |||
|<code>BB.lhs</code> | |||
|Haskell | |||
|- | |- | ||
|Register Machine | |Register Machine | ||
Revision as of 12:10, 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 |
|---|---|---|---|
| CounterScript | https://github.com/AzertyWasTaken/CounterScript | main.js
|
JavaScript |
| Fractran | https://github.com/int-y1/BBFractran | fractran20260416.cpp
|
C++ |
| Lambda Calculus | https://github.com/tromp/AIT/blob/master/BB/BB.lhs | BB.lhs
|
Haskell |
| Register Machine | https://github.com/int-y1/BBFractran | rm.cpp
|
C++ |
| Turing Machine | https://github.com/sligocki/busy-beaver | Enumerate.py
|
Python |