What is Turing Complete?

Here’s the briefest explanation:

A Turing Complete system means a system in which a program can be written that will find an answer (although with no guarantees regarding runtime or memory).

So, if somebody says “my new thing is Turing Complete” that means in principle (although often not in practice) it could be used to solve any computation problem.

Sometimes it’s a joke… a guy wrote a Turing Machine simulator in vi, so it’s possible to say that vi is the only computational engine ever needed in the world.

Leave a Comment