I need the proof for the computability of
Speed problem : Find the fastest program P
SP(i) = j | Pj is fastest (with Pj equivalent to Pi)
It is a kind of "Halting problem". This problem is not computable.
(I may even describe the problem incorrectly!)
Thanks
tr...@esd.dl.nec.com