Skip to content
#

proof-complexity

Here are 4 public repositories matching this topic...

Language: All
Filter by language
The-Thiele-Machine

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 Jul 23, 2026
  • OCaml

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