You would need to invent a complexity class larger than R, one that contains more than countably infinite programs. Those, too, can be diagonalised, there would still be incomputable functions. Our whole argument would repeat with that complexity class instead of R. Rinse and repeat. By induction, nothing changes, Q.E.D.
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
replies: