[nocipher]

Combinatorics deals with discrete structures, the kind encountered in programming, while probability concerns itself with determining the likelihood of a given event. The former is clearly more relevant to general programming.

Probability does use some tools from combinatorics and vice versa, but the two subjects have vastly different goals.

[stiff]

Yes, I understand combinatorics is different from probability theory and yes, he is somewhat mistaken in not distinguishing combinatorics from probability theory, but on the other hand the article is clearly meant to be informal, it isn't a dissertation on the division of (highly overlapping) sciences. Above all else, I find the statement from the critique above that "probability is decidedly non-discrete" wrong much more clearly then any statements from the original posting.

Similarly I find it highly questionable whether combinatorics is "clearly more relevant to general programming". In fact, what is "general programming"? Probability theory pervades all of Computer Science - from probabilistic algorithms (QuickSort), through cryptography, optimization algorithms (genetic algorithms, simulated annealing), networking (information theory, queuing theory), machine learning, the list goes on and on. For business programming, statistics (based on probablity theory) is crucial. Some of those applications include combinatorics, but I find it harder to find such a long list of applications of combinatorics being used without probability theory - it is a more specialized field.