| 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. |
| 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. |