Turing Complete

In computability theory, a system of data-manipulation rules (such as a computer's instruction set, a programming language, or a cellular automaton) is said to be Turing complete or computationally universal if it can be used to simulate any single-taped Turing machine. The concept is named after Alan Turing. A classic example is lambda calculus. http://en.wikipedia.org/wiki/Turing_completeness

cf Turing

Strange things that are Turing Complete:

Edited:    |       |    Search Twitter for discussion