EricHehner

23 ms·

1. 1.▲
   by EricHehner 6y ago

   Your advice is good.
2. 2.▲
   by EricHehner 6y ago

   I said: So it may be consistent and satisfiable to ask for a Y-program to compute halting for all X-programs. At least it has not yet been proven impossible. You said: Alas, it has been proven. RAM computers are equivalent to Turing machine
3. 3.▲
   by EricHehner 6y ago

   You point out quite correctly that if halting can be solved, then we can use it to settle certain open mathematical questions. But this does not tell us whether halting can be solved. (And if it can, it may not be a practical way to settle
4. 4.▲
   by EricHehner 6y ago

   Mathematical results should never be accepted or rejected by whether you "trust this guy". You should read the work, think about it, and decide for yourself whether the results are right or wrong.
5. 5.▲
   by EricHehner 6y ago

   I may be notorious, but not for the work I've done, rather for the misinformation about me that is repeated by people who don't check. I have written and published papers that say halting for programs in one formal system (languag