Turing completeness

Turing completeness means the ability

to use a code base to perform virtually any task,

as long as it has the correct instructions,

enough time, enough processing power.

Last updated