3 ms·
I'd throw in some order theory too. Posets, lattices, boolean algebras etc. All crop up pretty often, if you know how to recognise them. In fact I think often
by matthw 17y ago
I'd throw in some order theory too. Posets, lattices, boolean algebras etc. All crop up pretty often, if you know how to recognise them.
In fact I think often when people recommend graph theory for computer science, they're thinking more about order theory (trees, DAGs, posets etc), or failing that, more the "basic algorithms over graphs" stuff than the "let's prove a bunch of clever theorems about k-colourings" kind of graph theory which you might get if you bought a book on it.
- jackfoxy 17y agoBoolean algebra is conspicously missing from the Basic List, probably because the parts of Boolean algebra that are most useful are the first thing any programmer learns (although there are plenty of people making a living programming who can't even do basic bit twiddling). Babbage conceptually invented a universal computer a couple of decades before Boole published his major opus.