Java implementation of DFA(Deterministic Finite Automata) and Turing Machine
-
Updated
Jun 26, 2022 - Java
Java implementation of DFA(Deterministic Finite Automata) and Turing Machine
An implementation of the mugda paper
Experiment around natural language and random UTF encoded streams
Heurística para solução do problema da parada.
Determining the probability of a Thue program halting.
Halting Theorem (Théorème de l'Arrêt) de Turing en Python et en Julia.
A demonstration of the Halting Problem in C#.
An explanation of busy beaver problem with samples and codes
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."