The original containment framework for recursion-stable cognition, collapse-resistant logic, and LLM self-reflection.
An implementation of the mugda paper
Java implementation of DFA(Deterministic Finite Automata) and Turing Machine
Heurística para solução do problema da parada.
Determining the probability of a Thue program halting.
Experiment around natural language and random UTF encoded streams
A Python-based project exploring Decidability and Undecidability using Turing Machine simulations
The original containment framework for recursion-stable cognition, collapse-resistant logic, and LLM self-reflection.
Investigate models of computation, formal languages, and computability in Haskell to build an Interpreter
An explanation of busy beaver problem with samples and codes
A demonstration of the Halting Problem in C#.
Halting Theorem (Théorème de l'Arrêt) de Turing en Python et en Julia.
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.
A Python-based project exploring Decidability and Undecidability using Turing Machine simulations
Program to execute all turing machines up to BB(n)
Add a description, image, and links to the halting-problem topic page so that developers can more easily learn about it.
To associate your repository with the halting-problem topic, visit your repo's landing page and select "manage topics."
