You are viewing a single comment's thread from:
RE: Tauchain (TML) - Partial Fixed Point Logic and it's unique benefits
Another enlightening post I took some new things from. I'll take a closer look at Datalog and Prolog. Also thanks for the link to the talk by profesor Dawar, great stuff. Have a nice Christmas!
P.S.: Have you considered making a post about the concept of Touring completeness? I got it after emerging myself into the material, but I still struggle when explaining it to others in a meaningful manner.
Turing completeness involves an abstract machine with infinite memory, being able to compute anything computable. The universe is finite, all apps running on computers are finite, but some algorithms you want to construct in a way which assumes the infinite because you have no way of predicting the future or when it should halt. If you know exactly how much resources the app will need then you can restrict the app to that amount, and it always halts.
Happy holidays.
This is a basic principle of FMT, and even quantum computers use a Boolean circuit model (Quantum circuit), making them Quantum Turing machines.
Thanks for the answer!