Hacker News new | ask | show | jobs
by _flux 704 days ago
I guess you could reformulate the intent of the problem as:

Let P be an arbitrary program and let n be equal to 3 if P terminates, or 5 if not.

Is it still malformed? Is so, then how about

Let n be equal to 3 Goldbach's conjecture is true, or 5 if not.