Day 26, Mat385

Last time

Next time

Announcements:
- Our quiz will cover chapter 7 (graph algorithms):
  - Euler paths and Hamiltonian Circuits
  - Shortest path algorithms (Dijkstra's, Bellman-Ford, Floyd) and Minimal spanning trees
  - Graph traversal (depth-first, breadth-first)
- 'We have to move fast': US looks to establish rules for artificial intelligence: The commerce department has requested public comment on AI accountability measures to ensure privacy and transparency
- Biden administration is trying to figure out how to audit AI: Agencies are taking steps to regulate artificial intelligence, seeking to minimize the technology's harm
Last time: We went over Section 8.1: Boolean Algebras, which brings both propositional logic and set theory under its umbrella.
Today:
- We hit 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 a quiz....
Links:
- Rooted Trees
- Using a directed, acyclic graph to represent an algebraic operation: Supplementary Material On-line

Website maintained by Andy Long. Comments appreciated.