Posts
LeoGlossary: Turing Completeness
25
@leoglossary
··
0 views
1 min read
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.
Posted Using LeoFinance Beta
