# Turing Completeness

Turing completeness is the ability for a system of instructions to simulate a Turing Machine.

A programming language that is Turing complete is theoretically capable of expressing all tasks accomplishable by computers; nearly all programming languages are Turing complete if the limitations of finite memory are ignored.