No system can model its own source. Empirical proof: 6 AI architectures (GPT-4, Claude, Gemini, DeepSeek, Grok, Mistral) hit the same structural wall.

Structural analysis of recursive stability and failure modes in self-referential cognitive systems.

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

An implementation of the mugda paper

Java implementation of DFA(Deterministic Finite Automata) and Turing Machine

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

Heurística para solução do problema da parada.

An explanation of busy beaver problem with samples and codes

Investigate models of computation, formal languages, and computability in Haskell to build an Interpreter

A demonstration of the Halting Problem in C#.

An investigation about halting problem.

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.

Academic notes on Computability of Algorithms explaining computable and non-computable problems, the Halting Problem, Turing Machine model, and decidable vs undecidable problems in Theory of Computation.

Halting Theorem (Théorème de l'Arrêt) de Turing en Python et en Julia.

Bounded Python demo and notes showing why full computational autonomy verification is undecidable in general (Rice's Theorem), and why practical assurance relies on bounds.

Program to execute all turing machines up to BB(n)