Determining the probability of a Thue program halting.
-
Updated
Oct 7, 2022 - JavaScript
#
halting-problem
Here are 3 public repositories matching this topic...
Experiment around natural language and random UTF encoded streams
nodejs automata state-machine binary information-theory bytes streams reality turing shakespeare cantor finite computability halting-problem debroille set-therory infinite-string monkeys-can-type digital-reality
-
Updated
May 31, 2020 - JavaScript
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.
-
Updated
May 23, 2025 - JavaScript
Improve this page
Add a description, image, and links to the halting-problem topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the halting-problem topic, visit your repo's landing page and select "manage topics."