Turing machine

From Conservapedia

A Turing machine is a theoretical representation of a computer, as imagined by Alan Turing, the founding father of modern computer science. Computer programs and algorithms are represented by a tape that is fed into the machine. The machine then executes the instructions on the tape.

Turing machines are useful because they do not suffer from physical limitations such as memory allocation, processor speed, or power usage. However, they may encounter problems executing certain programs; predicting when this happens is the idea behind the halting problem.