Note
CS Degree Day 71
Overview
I have a new appreciation for how deep this rabbit hole goes.
What I did today?
6.1910 Computation Structures:
- Lecture 1: Bits, boolean algebra, logic gates
- Lecture 2: Combinational logic, truth tables, sum of products
- Problem set: Simplify boolean expressions
The synthesis of a logic function from a truth table via sum of products, take every row where the output is 1, AND the inputs accordingly, OR all the results is an algorithm that turns mathematics into circuits. I find this section of the course the most alien, and therefore the most interesting.