Home Glossary
Turing Complete: Explained
Turing-complete is a term used to describe a computing machine capable of solving any problem that a Turing machine could solve given an unlimited amount of time and memory. To understand Turing completeness, you must first understand what a Turing machine is.