Table 1.

Nomenclature.

Term	Exposition
Finite-state machine	An abstract machine that can be in only one state at a time and a finite number of states in total. Its memory is defined by the number states available.
Turing machine	A finite-state machine extended with a so-called tape. The tape is a read/write memory component where symbols can be stored and recovered.
Turing completeness	Refers to the ability of a given set of instructions to simulate a Turing machine.
von-Neumann implementation	Denotes a common schematic circuit concept (and its many offshoots) that actually implement a universal Turing machine.

This table provides brief expositions of terms and concepts from theory of computation that might not be familiar to all readers. Note that these are working definitions for the purpose of this paper, they are not meant to be exhaustive.