Tools for finding Busy Beaver Turing Machines and Proving others as non-halting
-
Updated
Dec 14, 2024 - Python
#
busy-beaver
Here are 15 public repositories matching this topic...
Simulating Turing machines for the Busy Beaver game
-
Updated
Feb 12, 2022 - Rust
Tools for finding and analyzing Busy Beaver programs for Turing machines
-
Updated
Dec 15, 2024 - Python
Efficient Turing machine simulator for evaluating busy beaver programs with up to 6 states.
-
Updated
Dec 6, 2020 - C++
A simple C program to emulate two symbol turing machine
-
Updated
Mar 15, 2022 - C
A functioning Turing Machine inside Notepad++ using find/replace and regular expressions
-
Updated
Jan 14, 2020
-
Updated
Sep 17, 2021 - Python
-
Updated
Jun 1, 2021 - Rust
-
Updated
Dec 10, 2021 - Python
Java program that calculates 3-state, 2-symbol busy beaver
-
Updated
Jan 29, 2024 - Java
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.
-
Updated
Sep 15, 2024 - Python
An explanation of busy beaver problem with samples and codes
-
Updated
Jul 20, 2023 - Python
-
Updated
May 24, 2022 - Python
Improve this page
Add a description, image, and links to the busy-beaver topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the busy-beaver topic, visit your repo's landing page and select "manage topics."