A self-verifying proof that the Thiele Machine is a universal model of computation which strictly contains the Turing Machine as a blind, special case. All open source.
-
Updated
Dec 17, 2025 - Python
A self-verifying proof that the Thiele Machine is a universal model of computation which strictly contains the Turing Machine as a blind, special case. All open source.
Lean 4 formalization of Unlimited Register Machines for CSLib
Add a description, image, and links to the church-turing-thesis topic page so that developers can more easily learn about it.
To associate your repository with the church-turing-thesis topic, visit your repo's landing page and select "manage topics."