You're viewing a single thread.
N is the set of "counting numbers".
When you count upwards you start from 1, and go up. However, when you count down you usually end on 0. Surely this means 0 satisfies the definition.
The natural numbers are derived, according to Brouwer, from our intuition of time of time by the way. From this notion, 0 is no strange idea since it marks the moment our intuition first begins _
0 is natural.
Source - programming languages.
*Most programming languages
We don't talk about those kids, they're weird. :)
I don't personally know many programming languages that provide natural number type in their prelude or standard library.
In fact, I can only think of proof assistants, like Lean, Coq, and Agda. Obviously the designer of these languages know a reasonable amount of mathematics to make the correct choice.
(I wouldn't expect the same from IEEE or W3C, LOL
It's really just a joke about counting from 0 instead of 1.
Oh, array indexing, sure.
countable infinite set are unique up-to bijection, you can count by rational numbers if you want. I don't think counting is a good intuition.
On the contrary - to be countabley infinite is generally assumed to mean there exists a 1-1 correspondence with N. Though, I freely admit that another set could be used if you assumed it more primitive.
On the contrary - to be countabley infinite is generally assumed to mean there exists a 1-1 correspondence with N.
Isn't this what I just said? If I am not mistaken, this is exactly what "unique up-to bijection" means.
Anyways, I mean either starting from 1 or 0, they can be used to count in the exactly same way.
I'm arguing from the standpoint that we establish the idea of counting using the naturals - it's countable if it maps to the naturals, thus the link. Apologies for the lack of clarity.