3 ms·
The point is that there are more real numbers than possible finite descriptions, so some real numbers must be indescribable. Related (and more precisely define
by mkl 13y ago
The point is that there are more real numbers than possible finite descriptions, so some real numbers must be indescribable.
Related (and more precisely defined) concepts include (non)definable and (non)computable numbers, http://en.wikipedia.org/wiki/Definable_number http://en.wikipedia.org/wiki/Definable_number and http://en.wikipedia.org/wiki/Computable_number http://en.wikipedia.org/wiki/Computable_number respectively.
- gizmo686 13y agoBusy Beaver numbers are perfectly describable. They are just not computable, and (for sufficiently large inputs) larger than any computable value.
- cousin_it 13y agoCool, I only just realized that applying the diagonal argument to computable numbers leads to the halting problem, and applying the diagonal argument to definable numbers leads to Tarski's undefinability of truth.