The halting problem is Turing-complete for r.e. sets, but 'highest degree' conflates m-reducibility ...