Hacker News new | ask | show | jobs
by chmod775 1802 days ago
> It is obvious that all expressions in the English language can be ordered from smallest to largest and lexicographically, which makes these expressions trivially countable.

You could say the same about just real numbers, which can also be ordered from smallest to largest. This definitely not 'trivially' implies countability.

Edit: I edited my post shortly after posting from "Humor me and count out the first two real numbers".

1 comments

EDIT: The parent first said (before being edited, with my original answer after the quote):

> Humor me and count out the first two real numbers in English in lexicographical order.

Probably "one" and "six" (then "ten" and "two", followed by all 4-letter expressions of real numbers), unless you can think of an English expression with a length of three letters or less that would occur before "one" and "six" lexicographically. If you consider "pi" or "e" to be descriptions of real numbers then clearly these would occur before "one" and "six".

But of course you can also pick an arbitrary universal Turing machine or other suitable formalism, pick an encoding as bit strings and order expressions in such a formal language according to their bit strings. Ordering expressions in the English language is only the less formal counterpart.

(If your point is that ordering expressions of real numbers in English is far from unambiguous without first agreeing on a dictionary of valid words and on rules of what can be considered an expression of a real number in more than one word then of course I would agree. But what I'm driving at is not that it's easy to unambiguously count out the real numbers in English, of course it's not, but rather that any kind of natural or formal language expressions, by being recursively enumerable, are "numerous" enough to be a countable set of expressions. To say that the real numbers are uncountable is to accept the view that there are real numbers that are not and can never be expressible in language, which is a view that only makes sense against the backdrop of a very specific philosophical framework. One that is definitely accepted more or less implicitly by most working mathematicians, but not the only possible one. And this philosophical framework cannot itself be justified or grounded by a mathematical argument such as Cantor's diagonal proof.)

---

Reply to the parent after edit:

> You could say the same about just real numbers, which can also be ordered from smallest to largest. This definitely not 'trivially' implies countability.

No, what I meant was that by ordering expressions in the English language or other suitable formal languages first from smallest string to largest string and within these groups lexicographically, you can enumerate all the expressions in such a language, which makes them trivially countable.

Of course this does not give you a 1:1 mapping from expressions in a language to real numbers, but it is meant to illustrate that the real numbers are not uncountable because they are 'too numerous' to be counted by the natural numbers, in the sense that a box is not large enough to hold a collection of things. They are uncountable because we accept the view that there can be real numbers that are not and cannot be expressible in language, which is a platonist view that is open to philosophical critique.

> Probably "one" and "six"

You missed infinitely many numbers between those two. For example "one thousand" and "one dot/comma three".

Once you've worked that all out, can you now tell me which natural number you assigned to "six" in your lexicographical order?

Edit: Ah. Took me a moment to realize you are ordering by number of characters first.

> They are uncountable because we accept the view that there can be real numbers that are not and cannot be expressible in language, which is a platonist view that is open to philosophical critique.

So similar to R \ Q? Or the same?

Oh, I see what the issue is. I wrote "smallest to largest and lexicographically", meaning first from smallest to largest (as measured by the length of the string) and then within each group lexicographically, which is the usual way of giving an enumeration of such expressions as far as I know. Of course you cannot enumerate these expressions if you expect a solely lexicographical ordering. In any case, English was just an example, you can basically pick any Turing-complete language that is recursively enumerable and count its expressions by considering its bit string encodings as natural numbers.

Edit: This is also why the computable numbers are countable, but not computably enumerable (because figuring out which expressions correspond to real numbers is equivalent to the halting problem).

You've convinced me that R without all numbers that are not expressible in typical languages is countable at least.

Though I'm not convinced that numbers that are not expressible don't exist. I could for instance say "the length of this line", which may very well have a length that is not expressible in a language that uses a finite set of symbols (hah, that's why your expressions are countable, of course!).

Consider a language however that instead of numbers simply uses sounds of the appropriate length, or draws lines of proportional length (assuming of course you could do this precisely).

With that language you could express every real number, and you could express numbers that turing machines* or English can't.

*Unless programmed in that language.

That's an interesting thought experiment, though I'm not sure how using "sounds of the appropriate length" or "lines of proportional length" would get you more than the rational numbers, which are already countable and thus fully captured by any Turing-complete language. To say that there are inexpressible real numbers is to say that there are numbers that are not rational but which can never be practically used or accessed either, at which point they become kind of like an invisible and unnoticeable unicorn: it is certainly possible to believe in its existence, but such a belief is quite different from the belief in the existence of practically useful real numbers such as pi.

I am not trying to convince anyone that inexpressible real number do or do not exist, but I think it's worth noting that these issues quickly cross over into the realm of philosophy, where it's not possible to justify a particular conviction by appealing to firm mathematical or practical reasons. Nothing wrong with that, of course.

Personally, I'm content with what is expressible in language and I consider mathematical concepts going beyond this boundary of expressivity as inessential to my own personal use, though I can certainly see that these mathematical calculi can be of interest to mathematicians on their own.

> though I'm not sure how using "sounds of the appropriate length" or "lines of proportional length" would get you more than the rational numbers, which are already countable and thus fully captured by any Turing-complete language

Consider the canonical form of Pi. You can't express it accurately in English, but you can have a distance of Pi length in the physical world, so you could express Pi by that distance.

Now we can refer to Pi in English because it is tied to a concept which we can describe and because we can assign a name to it.

If I picked two arbitrary points in the physical realm, then due to the distribution of real numbers there's a good chance you wouldn't be able to express the distance accurately in a language that uses a finite set of symbols/sounds to express numbers.

I'm convinced such 'numbers' exist however, Pi exists after all, and it happens to be just one we assigned a name to because it is of note.