Turing complete

A computer is Turing complete if it can solve any problem that a Turing machine can, given an appropriate algorithm and the necessary time and memory. When applied to a programming language, this phrase means that…

Turing Machine

A hypothetical device that manipulates symbols on a strip of tape according to a table of rules. Despite its simplicity, a Turing machine can be adapted to simulate the logic of any computer algorithm, and is…

Unpermissioned Ledgers

Unpermissioned ledgers have no single owner. It allows anyone to contribute data to the ledger and for everyone in possession of the ledger to have identical copies. Participants maintain the integrity of the ledger by reaching…

Glossary

  • Chain of custody A chain of custody refers to documentation or paper trail, in order of time, which…