Turing Complete

Any machine that can calculate on a level equal to a programmable computer is labelled as “Turing Complete” or “Computationally Universal”. Most modern programming languages are Turing Complete.

« Back to Glossary Index