A computer or programming language that is capable of simulating an arbitrary Turing Machine, which is a hypothetical computer proposed by Alan Turing.

A Turing complete system means a system in which a program can be written that will find an answer. The system is able to recognize or decide other data-manipulation rule sets.

Virtually all programming languages today are Turing complete.

Was this article helpful to you?


Comments are closed.