The Thiele Machine
Coq-Verified Computational Model Beyond Turing
Details
- External ID
- 46583363
- Source
- HN
- Company
- —
- Product
- The Thiele Machine
- Website domain
- github.com
- Launched
- Jan. 12, 2026
- Cohort
- —
- Upvotes
- 9
- Upvotes percentile
- 0.461133069828722
- Tags
- —
- Fetched at
- Sept. 7, 2026, 9:25 p.m.
- Updated at
- Sept. 7, 2026, 9:25 p.m.
Description
The Thiele Machine is a formally verified universal computational model the surpasses Turing machines in key ways. It's fully proven in Coq (including kernel theorems and universality containment), features a python implementation for simulation and includes hardware designs in Verilog for potential FPGA/ASIC builds. The core idea: a paradigm shift using μ-bits for stricter computation under real-world constraints, tying into physics (e.g., Noether’s theorem) and emergence in chaotic systems.The repo includes a 13-chapter thesis (PDF and sources), proofs, and tools for exploration. It’s aimed at formal methods enthusiasts, AI researchers, and hardware devs interested in verifiable, adaptive reasoning beyond traditional limits. Feedback welcome on the proofs, emergence chapter, or hardware impl, let’s collaborate!
Enrichment
- Theme
- scientific computing and deep tech tools
- Vertical
- —
- Function
- Dev tools
- Audience
- Developer
- AI stance
- Not AI
- Project type
- Hobby / open-source project
- Normalized one-liner
- verified computational model
- Manually corrected
- False
Could you build this?
No Developing a novel computational model formally proven in Coq alongside Verilog hardware specifications is cutting-edge theoretical computer science and formal verification research.
What it would actually take: Requires deep expertise in theoretical computer science, interactive theorem proving (Coq), formal semantics, and digital logic design (Verilog). The hard parts are formulating non-trivial kernel theorems, maintaining soundness across universality containment proofs in Coq, and synthesizing functional Verilog descriptions.
Discussion
4 comments analyzed.
Concerns raised: Falsifiability of claims unclear despite Coq proofs, Skepticism about 'beyond Turing' framing and practical relevance, Simulation performance concerns
Feature requests: ASIC optimization for low-power emergent logic, Hardware acceleration beyond FPGA prototyping
Competitors
Other products that read as similar to this one — 152 launches clear the similarity bar, closest 8 shown.
Attention rank: #70 of 153 (itself plus its competitors, highest first — normalized so YC and Product Hunt are compared fairly).
Launched 65 days after the earliest competitor.
- My attempt to formalize "Buddhist" reality · hn · 2026-01-15 · 5 upvotes · similarity 0.49
- genpark-hoare-logic-wp-calculus-skill · github · 2026-09-10 · 7 upvotes · similarity 0.48
- Cajal: Scaling Formal Verification for Scientific Discovery · yc · 2026-02-24 · 15 upvotes · similarity 0.48
- Coda — Natural language quantum computing · yc · 2026-01-21 · 10 upvotes · similarity 0.46
- genpark-hoare-logic-axiomatic-verifier-skill · github · 2026-09-28 · 7 upvotes · similarity 0.43
- Running PrismML's Bonsai inside DRAM by breaking DDR4 timing rules · hn · 2026-07-23 · 23 upvotes · similarity 0.43
- SymDerive · hn · 2026-02-01 · 26 upvotes · similarity 0.43
- Symbolic Circuit Distillation: prove program to LLM circuit equivalence · hn · 2026-01-06 · 16 upvotes · similarity 0.42
Other launches for this product
- No other launches for this product.