This mapping to numbers implies a total order on problem classes with computerists' problems being even more <lesser integer>-worldish than the plain old first world problems. I believe this is not the case. Computerists' problems are incomparable to i-th world problems, for i in {1,2,3}.
I think you missed the joke. In every day life, ordinals start at one. Formally, they start at zero (we owe their modern definition to non other than von Neumann).
A programmer's 0th world problem really is a first world problem, taking into account the fact that we count differently.
