Author of this content has low reputation.

LeoGlossary: Turing Completeness

Words
35
Reading
1 min
4y
Listen to this post
~1 min

If a machine is capable of performing all conceivable programmable calculations, then it is Turing complete. This machine can process any computable function and includes most modern computers.