Turing completeness

Turing completeness is a way of describing something that can do any computation you can imagine. It's like your math teacher giving you a test - if your answer to the problem is correct, then the test is considered complete! A computer system is Turing complete if it can solve any problem you can think of, no matter how complex.

Related topics others have asked about:

AI-completeness, Algorithmic information theory, Chomsky hierarchy, Church–Turing thesis, Computability theory, Emulation (computing), Inner loop, Loop (computing), Machine that always halts, Rice's theorem, Smn theorem, Structured program theorem