| Ma/CS 6c |
|
| Introduction
to
Discrete Mathematics |
|
| Spring 2013-14 | |
|
|
|
Instructor: Andrew
Marks, 260 Sloan, marks@caltech.edu
|
|
|
|
|
| The
material covered in this term will include an introduction to
mathematical logic, including propositional and predicate (or
first-order) calculus, computability theory, and computational
complexity. We will discuss the syntax and semantics of formal
languages, formal proofs, the Gödel Completeness and
Incompleteness Theorems, undecidability and intractability, and the
P=NP problem. |
|
|
|
There will be a weekly homework assignment due on Tuesday at 1pm. The lowest homework score will be dropped. There will be no exams for the class.
On
each
homework
there
will
be
one
starred
problem on which no
collaboration is allowed. For the other problems, collaboration is
allowed but you should write up your own solutions. You cannot look up
solutions to the problems from any source. No late submissions are allowed except for
medical problems (note needed from the health center) or serious
personal difficulties (note needed from the Dean's Office). |
|
|
There will be no textbook. The course will be self-contained. |
|
|
|
|
|
|