The Thiele Machine: A Formal Proof of a New Computational Model
1 ThieleMachine 2 8/21/2025, 10:23:05 PM github.com ↗
Comments (2)
ThieleMachine · 6h ago
Author here. This repository contains the formal specification and reference implementation of a new model of computation.
The core of the work is the formal proof in thielecpu/coq/ThieleMachine.v. This file contains the machine-checked proofs for two main theorems:
1. Turing-Completeness: The machine can simulate any Turing Machine.
2. The Paradox-Cost Theorem: The machine operates under a formal law where a detected logical contradiction corresponds to a provable, infinite information-theoretic cost (cost_of_paradox_is_infinite).*
The Python code is a reference implementation designed for empirical testing. The README.md serves as the technical paper explaining the model and its implications.
I invite you to review the formal proofs and the experimental results.
nabla9 · 6h ago
aislop