Skip to main content

Posts

Showing posts with the label Turing Machine

On Bitcoin: It is a Total Turing Machine

  On August 24, 2019, Craig S. Wright, a man wrote a conference paper titled Bitcoin, A Total Turing Machine . In Wright’s paper, Wright stated that he demonstrated the Bitcoin script language is capable of primitive recursion, but it can also deploy an Ackermann function. So, the Ackermann function can simply recurse within Bitcoin script: it is proof Bitcoin as a script system is Turing complete ( link ). Wright went a step further by introducing a new Turing machine class, the PTTM (probabilistic total Turing machine): it allowed him to find an artifact capable of acting as a verifier for a non-interactive, associated TM as a proof system. In typical use cases, Bitcoin is capable of secure contract offers including best fit solutions to logistic information systems, optimization problems such as the travelling salesman problem, and optimizing systems. In application, Bitcoin can be offered in 2 different contracts: open or time-bound contract, guaranteeing payment, but it allows the

Contact Form

Name

Email *

Message *