Why P Versus NP Is Unprovable
"P = NP in that their difference is unprovable, but not in that they are identical, which is also unprovable." This episode unpacks that one-line reply and the precise limit it marks.
The claim is about formal reach: within ZFC, or any comparable system strong enough to formalize arithmetic and Turing machines, neither the equality nor the inequality of the two classes can be derived. It does not say the classes are the same, that they differ, or that the question is meaningless.
Along the way:
Mathematical equality is introduced by rule (extensionality, substitution), not discovered as…
The skinny
The skinny isn't ready yet — notes appear once the transcript is processed.