4 ms·
Its not fully general. Many different types of undecidability proofs are basically proofs by diagonalization, but not all are. See some counter examples: https
by abdullahkhalids 3y ago
Its not fully general. Many different types of undecidability proofs are basically proofs by diagonalization, but not all are. See some counter examples:
https://mathoverflow.net/q/454105 https://mathoverflow.net/q/454105
- srcreigh 3y ago“I genuinely don’t have an operational definition for what it means to use diagonalization” - Terry Tao