Warp wrote:
>   An algorithm which solves the halting problem would prove (or disprove)
> the Goldbach's conjecture with its answer

FWIW, Rice's Theorem basically say *any* property that some but not all 
functions have can be turned into the halting problem. So if there's 
anything non-trivial you want to find out about what a function computes, 
it's just as impossible to compute as the halting problem is.

-- 
Darren New, San Diego CA, USA (PST)
   Serving Suggestion:
     "Don't serve this any more. It's awful."

Post a reply to this message