I agree (based on Dijkstra's arguments, I'm not smart enough to come up with my own) that 0-based indexing is the more logical, general choice, but 1-based indexing is more convenient for about 99% of the code written in Fortran, Matlab or Julia.
No, it's not. There is no universally preferred indexing in mathematics. The indexing scheme that is "natural" changes with the particular application.
There are of course instances when 0-based indexing makes more sense [1], [2]. But, there are cases when starting at 1 is more natural, as well [3]. Moreover, there are instances where starting with negative indices is more natural, say with the coefficients of the truncated Fourier series, or with the weights of a finite difference operator or of a cross-correlation operator.
Fortran supports all these conventions, which allows for a more direct translation of the mathematics to code.
[1]: https://en.wikipedia.org/wiki/Geometric_series#Formula
[2]: https://en.wikipedia.org/wiki/Taylor_series#Definition
[3]: https://en.wikipedia.org/wiki/Harmonic_series_(mathematics)
You could make the same argument for octal literals over the scary hex numbers with letters mixed in. 1-based indexing was invented by mathematicians using conventional notation without fully appreciating the problems it causes in computing systems. There is no reason to continue the insanity.
http://www.cs.utexas.edu/users/EWD/transcriptions/EWD08xx/EW...
This is only the case for 1..N, not for I..J, when 'I' is not one. In this general case, the number of elements is 'J-I' if using zero-based numbering and exclusive upper bounds, which is more convenient. Zero-base also simplifies index arithmetic with modulo operations, such as when you are mapping between different index spaces.
Here's some more grist to the mill, currently on the HN front page:
Julia, as far as I understand, consciously mimicked Matlab there, to facilitate transition.