|
|
|
@ -239,7 +239,7 @@ transaction pool::
|
|
|
|
|
An unordered collection of transactions that are not in blocks in the main chain, but for which we have input transactions.
|
|
|
|
|
|
|
|
|
|
Turing completeness::
|
|
|
|
|
A program language is called "Turing complete", if that it can run any program that a Turing machine can run given enough time and memory.
|
|
|
|
|
A program language is called "Turing complete," if that it can run any program that a Turing machine can run given enough time and memory.
|
|
|
|
|
|
|
|
|
|
unspent transaction output (UTXO)::
|
|
|
|
|
UTXO is an unspent transaction output that can be spent as an input in a new transaction.
|
|
|
|
|