# SP18:Lecture 23

($1)$2 | $3 ($4) | $5 ($6)

We show that there are unrecognizable languages in three ways:

1. using Cardinality
2. by showing is unrecognizable
3. using the pumping lemma