Assignment 1: Due Thurs 4/7
Read text, chapters 0, 1, 2
1. What do you know about sets A and B if the following is true? (U = all elements in the universe).
a. A B = A
b. A B =
c. A B = B
d. A B = A B
e. A B = A
2.Show that the following sets are countab

Chapter 1
Chapter
Set Theory
Limits of Computation
Clayton Johnson
Edna Reiter
Sets
A set is a collection of
members or elements
A set is said to contain its members
There must always be an
underlying universal set U
Limits of Computation by Johnson & Rei

NP-Completeness
NP-Completeness
Limits of Computation
Clayton Johnson
Edna Reiter
Two definitions for NP
Definition 6.1: A
decision problem P is in
NP if there is a
Nondeterministic Turing
Machine that runs in
time bounded by a
polynomial.
Definition 6.2: