ciphergoth comments on [LINK] Cantor's theorem, the prisoner's dilemma, and the halting problem - Less Wrong

13 Post author: Qiaochu_Yuan 30 June 2013 08:26PM

You are viewing a comment permalink. View the original post to see all comments and the full post content.

Comments (9)

You are viewing a single comment's thread.

Comment author: ciphergoth 01 July 2013 06:32:35AM *  0 points [-]

This isn't about the "meat" of your post, but: for someone who's finding Cantor's theorem hard to believe, it might be worth avoiding proof by contradiction, which can be confusing. I'd rather say "Let f be any element of (2^X)^X. Define S_f(x) = 1 - f(x)(x). Then for any x, f(x)(x) != S_f(x), which means f(x) != S_f. So for every f, there's an S_f such that there's no x that represents it."