A functioning Turing Machine inside Notepad++ using find/replace and regular expressions
-
Updated
Jan 14, 2020
A functioning Turing Machine inside Notepad++ using find/replace and regular expressions
Java program that calculates 3-state, 2-symbol busy beaver
Efficient Turing machine simulator for evaluating busy beaver programs with up to 6 states.
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.
My other website.
An explanation of busy beaver problem with samples and codes
Simulating Turing machines for the Busy Beaver game
A simple C program to emulate two symbol turing machine
Tools for finding and analyzing Busy Beaver programs for Turing machines
Tools for finding Busy Beaver Turing Machines and Proving others as non-halting
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."