Yesterday in a technical conversation I used the phrase ‘HP-complete’.
I had intended it, by analogy with ‘NP-complete’, to mean that if the problem under discussion could be solved, the solution would necessarily include a solution to the Halting Problem, i.e. the problem was as hard as the Halting Problem, i.e. uncomputable.
There are several other
(
Read more... )