halting-problem

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

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

A distributed computation primitive based on oblivious projection, local admissibility, and relational state.

An implementation of the mugda paper

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

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.

Determining the probability of a Thue program halting.

A Python-based project exploring Decidability and Undecidability using Turing Machine simulations

Experiment around natural language and random UTF encoded streams

Undecidable connectivity of computable fractal limit sets: Pi01-completeness, an Omega-comb encoding Chaitin's Omega, no computable critical scale, and provability thresholds set by K(F) (Paper 6)

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

blam — binary lambda machine: classical and quantum algorithmic information theory in binary lambda calculus. Exhaustive censuses, BBλ frontiers, Ω/K measurements, Lean-checked divergence certificates.

A demonstration of the Halting Problem in C#.

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

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

An explanation of busy beaver problem with samples and codes

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.

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.