It does say that, because the list of computable functions is infinite, but he's also saying that for every computable function there's "another one", this d function. Which means that the list of functions is longer than the list of computable functions, therefore at least one of them must be uncomputable.
Complexity 26:45
nice, down to earth.
awesome lecture :)
at 18:00 - doesn't he just prove that it is impossible to list all computable functions, rather than proving there are uncomputable functions?
It does say that, because the list of computable functions is infinite, but he's also saying that for every computable function there's "another one", this d function. Which means that the list of functions is longer than the list of computable functions, therefore at least one of them must be uncomputable.
who stole my chalk :D
great
one view? me? shame on America