> Why does Cantor's method work well here? ...algorithms / programs are countably infinite, no? It seems that A (computable functions that take an integer and

> Why does Cantor's method work well here? ...algorithms / programs are countably infinite, no? It seems that A (computable functions that take an integer and return 0 or 1) are countably infinite but Q (all functions that take an integer and return 0 or 1) are uncountably infinite. As it turns out, there's a lot more stuff that we can't prove than stuff we can.