Tools for finding Busy Beaver Turing Machines and Proving others as non-halting

Tools for finding and analyzing Busy Beaver programs for Turing machines

Simulating Turing machines for the Busy Beaver game

My other website.

Efficient Turing machine simulator for evaluating busy beaver programs with up to 6 states.

A simple C program to emulate two symbol turing machine

A functioning Turing Machine inside Notepad++ using find/replace and regular expressions

A busy beaver Turing machine.

Fully verified Coq proof for the one-state Busy Beaver machine — a minimal example of formal halting verification.

Program to execute all turing machines up to BB(n)

An explanation of busy beaver problem with samples and codes

A Python-powered playground for exploring Busy Beaver Turing machines. It enumerates all possible TMs with specified states and symbols, runs simulations in parallel, and spots the most productive and longest-running halting machines. Perfect for enthusiasts and researchers diving into the fascinating world of computation theory.

Multithreaded brute-force search for the 4-state 2-symbol Busy Beaver Turing machine

Java program that calculates 3-state, 2-symbol busy beaver

In theoretical computer science, the busy beaver game aims to find a terminating program of a given size that either produces the most output possible, or runs for the longest number of steps. N-state Turing machine is used with allowed symbols 1 and 0.

Busy Beaver Challenge

public files related to the Busy Beaver challenge