|
|
|
|
|
by truth_machine
1734 days ago
|
|
Sorry, but the (max) board size is not known in advance. Board grows as the Turing machine simulator is running. > What you can then do instead is, for example, to update the first half of the board in one transaction and then the second half in another transaction, i.e. two transactions are one generation Yes, we just need to add the external "driver" that partitions the board, determines the bounds of board parts, constructs transactions that do all the necessary work of updating the board, checks whether the computation is finished - in other words, does the hard work of partitioning the computation in the chunks of fixed predetermined size, which is only necessary because bitcoin script is not turing-complete. |
|
This is not what the article claims to show. It shows that the system bitcoin is turing complete.
Added to this, having an "external driver" and the system being turing-complete are not mutually exclusive.