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 program that uses grammar-guided generation to estimate the equivalence of context free grammars.
Comprendre la machine de Turing avec Brainfuck : Turing-complétude et problème de l’arrêt, 2026, Programmez! n°274, pp. 69-71.
Java implementation of DFA(Deterministic Finite Automata) and Turing Machine
A compositional toolkit for mechanised undecidability in Lean 4.
A Python-based project exploring Decidability and Undecidability using Turing Machine simulations
Code, data, figures and manuscript for "Uncomputable Fractal Dimensions, Kolmogorov Complexity Cascades, and the Chaitin Barrier in Physical Systems" (R. Chen, 2026).
Artifact of the POPL paper Undecidability of D<: and Its Decidable Fragments
Formalizing interface adaptation undecidability.
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)
To associate your repository with the undecidability topic, visit your repo's landing page and select "manage topics."