Day 27, Mat385

Last time

Next time

Announcements:
- Our quiz this week will cover sections 8.1 and 8.2:
  - Boolean Algebras
  - The three sides of the same coin: truth functions, logic networks, and Boolean expressions
- No quiz next week! We'll be reviewing on that Thursday.
- Your projects are due on Friday of next week. Some of you had better get started!:)
- What if A.I. Sentience Is a Question of Degree?: A conversation with Nick Bostrom, a philosopher at Oxford, who has spent decades preparing for the day artificial intelligence is capable of anything the human brain can do.
Last time: We went over Section 8.2: Logic Networks, in which we encounter three different ways of thinking about the same problem: a truth table, a Boolean expression, and a logic network.
Then we had a quiz over graph algorithms.
Today:
- Let's start by having a look at the quiz:
  - Key
  - A few comments on the five parts:
    1. Two odd vertices: path exists, must start at an odd and end at an odd.
    2. Hamiltonian circuit exists, and must start and end at the same vertex.
    3. Please draw the tree! And compute the minimal weight (this one was unique).
    4. I only expected you to do one iteration of the scheme.
    5. Make sure that you show the order in which the nodes are printed out.
- It's on to Section 8.3: Minimization.
  I've made a handout with some of the tables we'll be using, so that you can play along.
Links:
- Shannon's 1938 paper A symbolic analysis of relay and switching circuits (here's a local copy)
- George Boole's biography

Website maintained by Andy Long. Comments appreciated.