2

In this Medium Article (https://medium.com/@craig_10243/bitcoin-a-total-turing-machine-5a6c3c68f5a7#_ftn2), C. Wright states:

"...It is known that all primitive recursive functions are total and computable, in this paper we also demonstrate using the Ackermann function that the Bitcoin script constructs include the ability to extend to total computable functions that are not primitive recursive. This demonstrates that Bitcoin can incorporate total computable functions that are simply “recursive” as well as primitive recursive."

What does this mean in mathematical terms?

5
  • 4
    Craig Wright is a known conman. There is no point in trying to decode his gibberish. – Pieter Wuille May 2 '20 at 17:28
  • It’s also not turing complete, in any sense of the word. You can not prove it is because it simply isn’t. It has a execution tape with defined opcodes, which have a specific and well understood limit. – Anonymous May 3 '20 at 2:15
  • The meaningless article seems to be saying that with an infinitely sized execution tape you could run a program indefinitely, which while literally true assumes an infinitely sized transaction and infinitely long execution, which doesn’t exist in Bitcoin. – Anonymous May 3 '20 at 2:20
  • @PieterWuille I would like to give it a shot from the point of an aspiring academic simply aiming to resolve some questions. – Abhinav May 4 '20 at 6:12
  • @Anonymous Right got your point. I simply enquired about use of Ackermann functions in using proving Turingness of a Script. – Abhinav May 4 '20 at 6:14

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.