Tools for finding Busy Beaver Turing Machines and Proving others as non-halting
-
Updated
Feb 20, 2025 - Python
Tools for finding Busy Beaver Turing Machines and Proving others as non-halting
Tools for finding and analyzing Busy Beaver programs for Turing machines
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.
An explanation of busy beaver problem with samples and codes
Add a description, image, and links to the busy-beaver topic page so that developers can more easily learn about it.
To associate your repository with the busy-beaver topic, visit your repo's landing page and select "manage topics."