Turing completeness does not require an infinite tape, and it was not an infinite tape that Turing mentioned in his paper; it was an unbounded system.
The blog post comes in response to criticisms from the BTC community and skeptics who insist that Bitcoin cannot be considered Turing complete.
Jerry Chan explores some more technical aspects behind Bitcoin BSV, and the lessor known under-the-hood components that are more of an interest to students of computer science.
A common feature of computer languages which generally make them Turing complete is the ability for the language to allow for structured control flow of a program, either through loops or jumps.
sCrypt does not support floating point natively, mainly due to the high overhead of implementing it using integral arithmetic in Bitcoin Script. However, there are many use cases where fractional numbers are indispensable.
This year’s Bitcoin SV DevCon is right around the corner, providing an excellent opportunity for developers to gain a deeper insight into the technology.
The episode's title is "DFAs and Financial Contracts." DFA are "deterministic finite automata," and Dr. Craig Wright says "I've put out some papers on this in the past... also got some patents on it.”
Knowing what information to process on-chain and what to process off-chain is a key theme of the Bitcoin Class series, featuring sCrypt founder Xiaohui Liu and Dr. Craig Wright.
A big concern of anyone dealing with digital currency is how to secure their coins. Many by principle are opposed to using custodial services to secure their Bitcoin, for good reason.
Episode 2 of Bitcoin Class with Satoshi touches on Semantic Web applications, provably fair gaming, verifiable proofs and zero-knowledge proofs.
Xiaohui Liu introduces a generic approach to skip on-chain computation in Bitcoin smart contracts, while ensuring security in the presence of malicious parties.