Day 18, Mat385

Last time

Next time

• Announcements
  • The quiz went well. The average was 10, as was the min and max. Variance was zero!

  • Projects! Your project proposals have been either approved or you still owe me something.
    • A few of you haven't submitted anything yet. I'm waiting...:(

      Email it to me directly. I'll get back to you with any comments or concerns.

      Remember: never make the grader mad!:)

    • You should not repeat a project that is already out there: one of your jobs as a reviewer will be to do a search to see if the project you're reviewing replicates something that is already out there. (My peer reviewers have proven to be adept at finding duplication in the past!:)

      For that reason, it pays to do your own search on your topic, and reference the work along the same lines that has already occurred.

    • You need to stress test the AI in some way. For that reason, you need a metric: that is a measuring stick, to determine how well the AI has done. What is the metric for your problem? How will you determine whether it has done a good job or a poor one?

    • I'll soon be creating accounts for you on the wiki, using your NKU username. I'll create a password and email it to you directly.

• Last time:
  • We began with an overview of the most interesting part of sets, i.e. that the power set of a set $S$, $\mathrm{\wp }(S)$, always satisfies $Card(\mathrm{\wp }(S))>Card(S)$ -- even when the set $S$ is infinite -- that is, there is an infinite set of larger and larger infinities!

  • Then we began section 6.1, graphs. We didn't quite finish that.

  • Marked up
    • highlights from 4.1
    • highlights from 6.1

• Today:
  • We'll wrap up Section 6.1 (Graphs).

  • Then we'll hit Section 6.2 (Trees).

• Some Fun, Motivating Examples from Propositional and Predicate Calculus