Enumeration: Difference between revisions

From BusyBeaverWiki
Jump to navigation Jump to search
Rewrite openning
Azerty (talk | contribs)
List of enumeration scripts: Created enumerators table.
Line 2: Line 2:


== List of enumeration scripts ==
== List of enumeration scripts ==
TODO
{| class="wikitable"
|+
!System
!Repository
!File Name
!Language
|-
|CounterScript
|https://github.com/AzertyWasTaken/CounterScript
|<code>main.js</code>
|JavaScript
|-
|Fractran
|https://github.com/int-y1/BBFractran
|<code>fractran20260416.cpp</code>
|C++
|-
|Register Machine
|https://github.com/int-y1/BBFractran
|<code>rm.cpp</code>
|C++
|-
|Turing Machine
|https://github.com/sligocki/busy-beaver
|<code>Enumerate.py</code>
|Python
|}

Revision as of 18:04, 17 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++
Register Machine https://github.com/int-y1/BBFractran rm.cpp C++
Turing Machine https://github.com/sligocki/busy-beaver Enumerate.py Python