Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

There's a "theorem" about this:

> The interesting number paradox is a semi-humorous paradox which arises from the attempt to classify every natural number as either "interesting" or "uninteresting". The paradox states that every natural number is interesting. The "proof" is by contradiction: if there exists a non-empty set of uninteresting natural numbers, there would be a smallest uninteresting number – but the smallest uninteresting number is itself interesting because it is the smallest uninteresting number, thus producing a contradiction.



That just sounds like another formulation of the Surprise Exam paradox.[0] It falls down when you realise that “the four hundred and seventieth otherwise uninteresting number” is not a particularly interesting number, so there must be a problem with the problem statement.

[0]: https://en.wikipedia.org/wiki/Unexpected_hanging_paradox


It's a paradox related to "meta-logic", but it's different. Surprise exam is about temporal reasoning -- It's only impossible to be surprised on the last day (or else the premise of having an exam is invalidsted), and reasoning backwards in time from a contradiction is not valid.

Uninteresting number is a simpler contradiction in definitions.


This is not a paradox though, as your copy and paste states. It's just a theorem (as you stated) with a proof by contradiction. A paradox must be self-contradictory under all circumstances.


It is a paradox. It assumes you have a definition of uninteresting number such that you can select the least uninteresting number, and then retroactively defines that number to be interesting by brand new criteria, which contradicts that you would have ever selected it in the first place. Thus the axioms invoked are mutually contradictory: the axioms that allow you to identify the least uninteresting number, and the axioms you invoke to declare it interesting are in conflict.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: