3 ms·
I get the feeling that when the article says "math[s]" it means continuous maths, like matrix arithmetic, calculus and statistics (judging by the examples given
by YeGoblynQueenne 7y ago
I get the feeling that when the article says "math[s]" it means continuous maths, like matrix arithmetic, calculus and statistics (judging by the examples given). Those can be useful, but not as immediately useful as the discrete maths for computer science that most programmers are (er, I think) at least somewhat familiar with: propositional and first-order logic, combinatorics, complexity theory, computational theory (including automata and languages) and, well, binary arithmetic.
Not to mention: algorithms.
I see the reference to category theory. That's discrete, of course, but it's intermediary to advanced. You don't get there without some solid foundations on logic, that you should expect to get from your CS course.
- kragen 7y agoI agree that discrete math is even more widely applicable to programming than continuous math, but I would add one quibble to your comment: matrix arithmetic is not necessarily continuous — Shamir secret sharing works by doing polynomial interpolation in a Galois field, and that's linear algebra, even if you never materialize the Vandermonde matrix. Similarly, Peterson–Gorenstein–Zierler decoding of Reed–Solomon codes — one of the most-widely-used ECC schemes — is grounded in matrix algebra over finite fields too. Myself, I've just started picking up some continuous math after years of neglecting it, because graphics, sound, probability, physical simulation, convex optimization, and neural networks are all continuous math. I feel like I've been really missing out!