
BSV as an Infinite Turing Tape
A Turing machine—or an unbounded number of them—can be built on top of the public infinite tape, and any number of parallel computations can be calculated.
A Turing machine—or an unbounded number of them—can be built on top of the public infinite tape, and any number of parallel computations can be calculated.
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.
More computer scientists are attesting to Dr. Craig Wright’s assertion that Bitcoin is Turing complete.