nwthiele

4 ms·

1. 1.▲
   by nwthiele 9mo ago

   Update: Thanks for the early feedback! To clarify the “beyond Turing” claim without fluff—it’s not about hypercomputation magic, but introducing μ-bits as a constrained bit model that enforces physical realism (e.g., conservation laws via N
2. 2.▲
   by nwthiele 9mo ago

   Fair, but the Coq proofs are zero-admit. Here is why it's falsifiable... https://github.com/sethirus/The-Thiele-Machine/blob/main/the... (Chapter 5)
3. 3.▲
   Show HN: The Thiele Machine – Coq-Verified Computational Model Beyond Turing(github.com)

   9 points by nwthiele 9mo ago|4 comments