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
            Oct 31, 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.
These are notes I have taken on my learning path. I hope they can be of use to others. Many are unfinished and, when I have the chance, I will update them (and eventually fix the formatting)
Add a description, image, and links to the computer-science-theory topic page so that developers can more easily learn about it.
To associate your repository with the computer-science-theory topic, visit your repo's landing page and select "manage topics."