FREE LESSON · Mathematics & logic · 3 OF 4
Discrete Mathematics for Computer Science
Four lenses for discrete problems — Sets, graphs, matrices, and probability
The same system becomes tractable through different lenses.
Sets answer membership and overlap. Graphs expose relationships and paths. Matrices encode linear transformations and pairwise structure in a form machines can process efficiently. Probability represents uncertainty rather than pretending incomplete knowledge is certainty. Mature problem solving means switching lenses without confusing the model for the world.
A powerful abstraction removes detail while preserving the operation you care about.
Recommendation as graph, matrix, and probability
Users and films form a bipartite graph. The same edges form an interaction matrix. A model can then estimate a probability that a user values an unseen film. Each view supports a different operation: traversal, linear algebra, or calibrated decision-making.
Equivalent information can have multiple useful forms; representation cost and available operations decide which one to use.