A Proof of Turing Completeness in Bitcoin Script
Date: 2022-12-05
Source: https://craigwright.net/blog/academics/a-proof-of-turing-completeness-in-bitcoin-script
The concept of a Turing machine has been well defined. It would be sufficient to show that Bitcoin uses a dual stack architecture that acts as a dual counter machine. Such systems have already been demonstrated as being Turing complete.
Extracted Insights (5 total)
82w · thesis:0
As the product rule states that if A, B are machines, then A.B is also a machine [17]. The iteration rule shows that if A is a machine then (A) is also a machine. Further the minimum power of A under ...
67w · thesis:1
We demonstrate that Bitcoin script is a minimal family of which and R are members. Further using the compositional product rule and the iteration rule we demonstrate that Bitcoin scripting is Turing...
45w · thesis:0
The full paper can be viewed online from SSRN: [A Proof of Turing completeness in Bitcoin Script by Craig S Wright :: SSRN The concept of a Turing machine has been well defined {[17], [20]}. It would ...
43w · thesis:0
The concept of a Turing machine has been well defined {[17], [20]}. It would be sufficient to show that Bitcoin uses a dual stack architecture that acts as a dual counter machine. Such systems have al...
43w · thesis:0
The concept of a Turing machine has been well defined {[17], [20]}. It would be sufficient to show that Bitcoin uses a dual stack architecture that acts as a dual counter machine. Such systems have al...