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
Posts
LeoGlossary: Turing Completeness
0 comments·0 reblogs
-2
@leoglossary·4 years ago
·
0 views
1 min read
