> Surprisingly, correctly describing the set of programs that have undefined behavior in a formal manner is the hardest part of formalizing C.
Isn't this undecidable?
Isn't this undecidable?
The halting problem is undecidable, but it's really easy to describe the set of programs that halt. I just described it right there!
That quote is talking about defining the set, not determining whether a program is a member of the set (which is indeed impossible in the general case).