0

The question is: can the halting problem be solved if the solver is not being assembled/emulated/generated/recreated/put your choice here/used in any form inside the analyzed function?

There is a very similar question: Is it possible to make a halting function if you don't call it on itself? but the answer for it is generally that "we don't call function rather we pass function", however, if we exclude such situations either, will it become solvable?

Community
  • 1
  • 1
Elstan
  • 1
  • Do you have any example code? – Robert May 29 '15 at 08:46
  • I'm not trying to find a solution, rather are there any other contradictions, which prevent solving the halting problem except referring in some way to itself? – Elstan May 29 '15 at 08:55
  • The solution might be a dictionary with pairs -. Of course it will require infinite memory for infinite possible inputs. But as I understand there are no limitations on resources in the halting-problem – Elstan May 29 '15 at 08:57

0 Answers0