Yes, but that doesn&#x27;t mean you can&#x27;t describe it.<p>The halting problem is undecidable, but it&#x27;s really easy to describe the set of programs that halt. I just described it right there!<p>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).