Skip to content
#

proof-complexity

Star

Here are 2 public repositories matching this topic...

Language: All
Filter by language
All 2 C++ 1 Python 1
The-Thiele-Machine

sethirus / The-Thiele-Machine

Star 3

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 because no one has convinced me not to.

python computer-science information-theory computational-geometry formal-methods turing-machine software-verification epistemology z3-smt-solver computer-science-theory proof-complexity thiele-machine sight-debt philosophy-of-computation church-turing-thesis
  • Updated Aug 26, 2025
  • Python

Improve this page

Add a description, image, and links to the proof-complexity topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the proof-complexity topic, visit your repo's landing page and select "manage topics."

Learn more