One former MIT student famously said: "6.120a didn't teach me to code. It taught me to think about code the way a mathematician thinks about the universe – with precision, skepticism, and elegance."
The subject focuses on mathematical tools and proof techniques used to reason about computational systems. Key topics include: Foundational Logic : Logical notation, sets, and relations. Proof Techniques : Induction and proofs by contradiction. Discrete Structures : Elementary graph theory, state machines, and invariants. Computational Math 6.120a Discrete Mathematics And Proof For Computer Science
Before you can prove a program correct, you must learn the language of logic. This module covers: One former MIT student famously said: "6
Prove that the square root of 2 is irrational. Prove that there are infinitely many primes. Prove that a binary tree of height h has at most 2^(h+1) - 1 nodes. Proof Techniques : Induction and proofs by contradiction