Enumeration: Difference between revisions

From BusyBeaverWiki
Jump to navigation Jump to search
Azerty (talk | contribs)
List of enumeration scripts: added lambda calculus enumerator
Azerty (talk | contribs)
List of enumeration scripts: Added General Recursive Function
Line 18: Line 18:
|<code>fractran20260416.cpp</code>
|<code>fractran20260416.cpp</code>
|C++
|C++
|-
|General Recursive Function
|https://github.com/sligocki/etc
|<code>enumerate.rs</code>
|Rust
|-
|-
|Lambda Calculus
|Lambda Calculus
|https://github.com/tromp/AIT/blob/master/BB/BB.lhs
|[https://github.com/tromp/AIT/blob/master/BB/BB.lhs https://github.com/tromp/AIT]
|<code>BB.lhs</code>
|<code>BB.lhs</code>
|Haskell
|Haskell

Revision as of 14:40, 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++
General Recursive Function https://github.com/sligocki/etc enumerate.rs Rust
Lambda Calculus https://github.com/tromp/AIT 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