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
An AI-powered interactive presentation on the Halting Problem, combining paradox generators, analogies, and quizzes with TailwindCSS design, to explore computability, logic limits, and undecidability in an engaging, technical format. Created as a part of the event Program Paradox hosted by ACM HITK STUDENT CHAPTER
Determining the probability of a Thue program halting.
Heurística para solução do problema da parada.
A Python-based project exploring Decidability and Undecidability using Turing Machine simulations
Experiment around natural language and random UTF encoded streams
The original containment framework for recursion-stable cognition, collapse-resistant logic, and LLM self-reflection.
A demonstration of the Halting Problem in C#.
An explanation of busy beaver problem with samples and codes
Investigate models of computation, formal languages, and computability in Haskell to build an Interpreter
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.
Program to execute all turing machines up to BB(n)
A Python-based project exploring Decidability and Undecidability using Turing Machine simulations
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."