You are viewing a single comment's thread from:

RE: Tauchain (TML) - Partial Fixed Point Logic and it's unique benefits

in #tauchain • 7 years ago (edited)

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.

7 years ago in #tauchain by
$0.00
    2 votes
    Reply 2
    Sort:  
  • Trending
    • [-]
     7 years ago 

    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.

    This is a basic principle of FMT, and even quantum computers use a Boolean circuit model (Quantum circuit), making them Quantum Turing machines.

    $3.82
    • Past Payouts $3.82, 0.00 TRX
    • - Author $2.86, 0.00 TRX
    • - Curators $0.95, 0.00 TRX
    1 vote
    Reply
    [-]
     7 years ago 

    Thanks for the answer!

    $0.00
      Reply