By using the quantum bit, a quantum Turing machine is created.

The NTM may be constructed by a deterministic Turing machine (DTM) using the four systems listed above.

The quantum Turing machine can easily constitute the quantum bit and surely execute a basic logical operation.

A Brownian Turing machine includes a multiplicity of alphabet elements, multiple state transition elements and a single enzymatic unit.

A worm can be represented as a Turing Machine whose state can be determined using computational methods.