BSV as a Turing machine
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.
Latest Turing complete News
Turing-Complete Rule 110 on Bitcoin
The Rule 110 cellular automaton is a 1-dimensional elementary CA, where a linear pattern of 0s and 1s evolves according to a simple set of rules.
The Bitcoin Bridge talks to Xiaohui Liu about sCrypt and unleashing Bitcoin’s full potential
This week's edition of The Bitcoin Bridge looks at a Bitcoin project that has definitely bridged the Pacific: sCrypt.
How to create artificial life inside Bitcoin
Connor Murray examines the history of the claim of Bitcoin’s Turing-completeness, and then creates artificial life that lives inside of Bitcoin forever.
Bitcoin script is Turing Complete: sCrypt’s ‘Game of Life’ is Proof
Contracts platform sCrypt has published code to a Bitcoin Script version of Conway's Game of Life, as a demonstration that the language is Turing Complete.
Theory of Bitcoin Part 5: Bitcoin and ‘Turing Completeness’ explained
The video series between Dr. Craig Wright and Ryan X. Charles is becoming essential background knowledge for anyone looking to truly understand Bitcoin.
Yes, Bitcoin can run any kind of smart contract
Bitcoin scripting is "extremely extensible, versatile, and future-oriented," with "unbounded" scaling, according to sCrypt Inc..
Bitcoin will move to 3 billion transactions per second, says Dr. Craig Wright
In a presentation at Brunel University in London, Dr. Craig Wright says Bitcoin will move to 3 billion transactions per second and beyond, which makes the platform suited to mass consumer payments.