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 9, 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.
CΩMPUTER: The Geometry of All Possible Machines
Add a description, image, and links to the philosophy-of-computation topic page so that developers can more easily learn about it.
To associate your repository with the philosophy-of-computation topic, visit your repo's landing page and select "manage topics."