0
$\begingroup$

I was looking at Turing machines and Turing completeness and I was wondering whether it is possible to prove that there is a problem which cannot be solved by a Turing complete computer or whether it is possible to prove the opposite.

$\endgroup$
  • 2
    $\begingroup$ What do you mean by "a code which cannot be solved"? What is "code"? $\endgroup$ – fade2black Dec 8 '17 at 20:31
  • $\begingroup$ Sorry, my mistake, I meant problem $\endgroup$ – 13ros27 Dec 8 '17 at 20:34
  • 3
    $\begingroup$ You may take a look at undecidable problems. $\endgroup$ – fade2black Dec 8 '17 at 20:37

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.