Turing-Complete
| A Turing-Complete system is one that can, in theory, solve any computational problem. This is opposed to a system that can only solve a specific set of problems, or one that can solve problems but not all of them. The term was first coined by Alan Turing, who is widely considered to be the father of computer science. |
Share this glosssary
