Next subject: Combinational logic
We know that everything can be done as Boolean functions
Boolean functions can be represented as a truth table
How do we use circuits to compute Boolean functions?
How can we be sure that we can compute any Boolean function?
How do we figure out what is the best circuit for a given logic function?
- Cost/size
- Speed
- (Reliability/Testability)