lecture26-cardinality.pdf - CSE 311 Foundations of Computing Lecture 26 Cardinality Uncomputability Course Evaluation Online • Fill this out by Sunday

lecture26-cardinality.pdf - CSE 311 Foundations of...

This preview shows page 1 - 12 out of 39 pages.

CSE 311: Foundations of Computing Lecture 26: Cardinality, Uncomputability
Image of page 1

Subscribe to view the full document.

Course Evaluation Online Fill this out by Sunday night! Your ability to fill it out will disappear at 11:59 p.m. on Sunday. It will be worth your while to do so!
Image of page 2
Last time: Languages and Representations All Context-Free Regular Finite 0* DFA NFA Regex {001, 10, 12} e.g. palindromes, balanced parens, {0 n 1 n :n 0} ?
Image of page 3

Subscribe to view the full document.

General Computation
Image of page 4
Computers from Thought Computers as we know them grew out of a desire to avoid bugs in mathematical reasoning. Hilbert in a famous speech at the International Congress of Mathematicians in 1900 set out the goal to mechanize all of mathematics . In the 1930s, work of Gödel and Turing showed that Hilbert’s program is impossible . Gödel’s Incompleteness Theorem Undecidability of the Halting Problem Both of these employ an idea we will see called diagonalization . The ideas are simple but so revolutionary that their inventor Georg Cantor was shunned by the mathematical leaders of the time: Poincaré referred to them as a “grave disease infecting mathematics.” Kronecker fought to keep Cantor’s papers out of his journals. Cantor spent the last 30 years of his life battling depression, living often in “sanatoriums” (psychiatric hospitals).
Image of page 5

Subscribe to view the full document.

Cardinality What does it mean that two sets have the same size?
Image of page 6
Cardinality What does it mean that two sets have the same size?
Image of page 7

Subscribe to view the full document.

1-1 and onto A function ࠵? ∶ ࠵? → ࠵? is one-to-one (1-1 ) if every output corresponds to at most one input; i.e. ࠵? ࠵? = ࠵? ࠵? ( ⇒ ࠵? = ࠵?′ for all ࠵?, ࠵? ( ∈ ࠵?. A function ࠵? ∶ ࠵? → ࠵? is onto if every output gets hit; i.e. for every ࠵? ∈ ࠵? , there exists ࠵? ∈ ࠵? such that ࠵? ࠵? = ࠵? . a b c d e 1 2 3 4 5 6 1-1 but not onto ࠵? ࠵?
Image of page 8
Cardinality Definition: Two sets ࠵? and ࠵? have the same cardinality if there is a one-to-one correspondence between the elements of ࠵? and those of ࠵? . More precisely, if there is a 1-1 and onto function ࠵? ∶ ࠵? → ࠵? . ࠵? ࠵? a b c d e 1 2 3 4 5 6 f The definition also makes sense for infinite sets!
Image of page 9

Subscribe to view the full document.

Cardinality Do the natural numbers and the even natural numbers have the same cardinality? Yes! 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 ... 0 2 4 6 8 10 12 14 16 18 20 22 24 26 28 ... What’s the map ࠵? ∶ ℕ → ࠵?ℕ ? ࠵? ࠵? = ࠵?࠵?
Image of page 10
Countable sets Definition : A set is countable iff it has the same cardinality as some subset of .
Image of page 11

Subscribe to view the full document.

Image of page 12
  • Spring '16

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern

Ask Expert Tutors You can ask 0 bonus questions You can ask 0 questions (0 expire soon) You can ask 0 questions (will expire )
Answers in as fast as 15 minutes