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
A Python-based project exploring Decidability and Undecidability using Turing Machine simulations
Artifact of the POPL paper Undecidability of D<: and Its Decidable Fragments
Add a description, image, and links to the undecidability topic page so that developers can more easily learn about it.
To associate your repository with the undecidability topic, visit your repo's landing page and select "manage topics."