>>13852336Basically if you give a description of a class of machines that is non-empty and not all partial computable functions, then the indicies for those machines will be non-computable. It follows from the fact that any nontrivial index set C that is not empty or all of N then either the halting set H is 1-reducible to C or H is 1-reducible to the complement of C.
