Great Theoretical Ideas in Computer Science. Lecture 5: Cantor s Legacy
|
|
- Brandon Marshall
- 5 years ago
- Views:
Transcription
1 Great Theoretical Ideas in Computer Science Lecture 5: Cantor s Legacy September 15th, 2015
2 Poll Select the ones that apply to you: - I know what an uncountable set means. - I know Cantor s diagonalization argument. - I used to know what uncountable meant, I forgot. - I used to know the diagonalization argument, I forgot. - I ve never learned about uncountable sets. - I ve never learned about the diagonalization argument.
3 This Week All languages? Decidable languages Factoring Regular languages EvenLength. 0 n 1 n Primality.
4 Our heroes for this week father of set theory father of computer science Uncountability Uncomputability
5 Infinity in mathematics Pre-Cantor: Infinity is nothing more than a figure of speech which helps us talk about limits. The notion of a completed infinity doesn't belong in mathematics - Carl Friedrich Gauss Post-Cantor: Infinite sets are mathematical objects just like finite sets.
6 Some of Cantor s contributions > The study of infinite sets > Explicit definition and use of 1-to-1 correspondence - This is the right way to compare the cardinality of sets > There are different levels of infinity. - There are infinitely many infinities. > N < R even though they are both infinite. > N = Z even though N(Z. > The diagonal argument.
7 Reaction to Cantor s ideas at the time Most of the ideas of Cantorian set theory should be banished from mathematics once and for all! - Henri Poincaré
8 Reaction to Cantor s ideas at the time I don t know what predominates in Cantor s theory - philosophy or theology. - Leopold Kronecker
9 Reaction to Cantor s ideas at the time Scientific charlatan. - Leopold Kronecker
10 Reaction to Cantor s ideas at the time Corrupter of youth. - Leopold Kronecker
11 Reaction to Cantor s ideas at the time Wrong. - Ludwig Wittgenstein
12 Reaction to Cantor s ideas at the time Utter non-sense. - Ludwig Wittgenstein
13 Reaction to Cantor s ideas at the time Laughable. - Ludwig Wittgenstein
14 Reaction to Cantor s ideas at the time No one should expel us from the Paradise that Cantor has created. - David Hilbert
15 Reaction to Cantor s ideas at the time If one person can see it as a paradise, why should not another see it as a joke? - Ludwig Wittgenstein
16 First we start with finite sets
17 How do we count a finite set? A = {apple, orange, banana, melon} What does A =4 mean? There is a 1-to-1 correspondence (bijection) between A and {1, 2, 3, 4} apple orange banana melon
18 How do we compare the sizes of finite sets? A = {apple, orange, banana, melon} B = {200, 300, 400, 500} What does A = B mean? apple orange banana melon
19 How do we compare the sizes of finite sets? A = {apple, orange, banana, melon} B = {200, 300, 400, 500} What does apple orange banana melon A = B mean? A = B iff there is a 1-to-1 correspondence (bijection) between A and B.
20 How do we compare the sizes of finite sets? A = {apple, orange, banana} B = {200, 300, 400, 500} What does A apple B mean? apple orange banana
21 How do we compare the sizes of finite sets? A = {apple, orange, banana} B = {200, 300, 400, 500} What does apple orange banana A apple B mean? A apple B iff there is an injection from A to B.
22 How do we compare the sizes of finite sets? A = {apple, orange, banana} B = {200, 300, 400, 500} What does apple orange banana A apple B mean? A apple B iff there is a surjection from B to A.
23 3 important types of functions injective, 1-to-1 f : A! B is injective if A,! B A B a 6= a 0 =) f(a) 6= f(a 0 ) surjective, onto f : A! B is surjective if 8b 2 B,9a 2 A s.t. f(a) =b A B A B bijective, 1-to-1 correspondence f : A! B is bijective if A $ B f is injective and surjective A B
24 Comparing the cardinality of finite sets A B A apple B A,! B A B A B A B A B A = B A $ B
25 Sanity checks A apple B i B A A,! B i B A A = B i A apple B and A B A $ B i A,! B and A B A $ B i A,! B and B,! A If A apple B and B apple C then A apple C If A,! B and B,! C then A,! C
26 One more definition A < B not A B There is no surjection from A to B. There is no injection from B to A. There is an injection from A to B, but there is no bijection between A and B.
27 So what is the big deal? This way of comparing the size of sets generalizes to infinite sets! These are the right definitions for infinite sets as well!
28 Comparing the cardinality of infinite sets A apple B A,! B A B A B A = B A $ B
29 Sanity checks for infinite sets A apple B i B A A,! B i B A A = B i A apple B and B apple A A $ B i A,! B and A B A $ B i A,! B and B,! A Cantor Schröder Bernstein If A apple B and B apple C then A apple C If A,! B and B,! C then A,! C
30 So what is the big deal? Let me show you some interesting consequences.
31 Examples of equal size sets N = Z N = {0, 1, 2, 3, 4,...} Z = {..., 4, 3, 2, 1, 0, 1, 2, 3, 4,...} , 1, 1, 2, 2, 3, 3, 4, 4,... f(n) =( 1) n+1 l n 2 m
32 Examples of equal size sets N = Z Does this make any sense? A ( B =) A < B? N(Z Shouldn t N < Z? Does renaming the elements of a set change its size? No. Z Let s rename the elements of : {...,banana, apple, melon, orange, mango,...} Let s call this set F. How can you justify saying N < F? Bijection is nothing more than renaming.
33 Examples of equal size sets N = {0, 1, 2, 3, 4,...} S = {0, 1, 4, 9, 16,...} N = S f(n) =n 2
34 Examples of equal size sets N = {0, 1, 2, 3, 4,...} P = {2, 3, 5, 7, 11,...} N = P f(n) =n th prime number.
35 Definition: countable and uncountable sets Definition: A set A is called countable if A apple N. A set A is called countably infinite if it is infinite and countable. A set A is called uncountable if it is not countable. (so A > N )
36 How to think about countable sets A set A is called countable if A apple N. So why is it called countable? A apple N means there is an injection f : A! N. you could count the elements of A (but could go on forever) A N
37 How to think about countable sets A set is called countable if. A A apple N Perhaps a better name would have been listable: can list the elements of A so that every element appears in the list eventually. a 1 a 2 a 3 a 4 a 5 (this is equivalent to being countable)
38 How to think about countable sets A set A is called countable if A apple N. This seems to imply that if A is infinite, then A = N. Is it possible that A is infinite, but A < N? Theorem: A set A is countably infinite if and only if A = N. So if A is countable, there are two options: 1. A is finite 2. A = N Exercise: prove the theorem
39 Countable? N = Z Z?. (0, 0) (1, 0) (1, 1) (0, 1) ( 1, 1) ( 1, 0) ( 1, 1) (0, 1) (0, 0) (1, 1) (2, 1) (2, 0) (2, 1) (2, 2) (1, 2). (0, 2).
40 Countable? N = Q? Can we list them in the order they appear on the line? Between any two rational numbers, there is another one. a Any rational number can be written as a fraction. a b Z Z Q ( map (a, b) to ) b =) Q apple Z Z = N
41 Countable? N = {0, 1}? {0, 1} = the set of finite length binary strings. " , 01, 10, , 001, 010, 011, 100, 101, 110, 111
42 Countable? N =? = the set of finite length words over. Same idea.
43 Countable? N = Q[x]? Q[x] Take = the set of polynomials with rational coefficients. e.g. x x2 +6x ={0, 1,...,9,x,+, 22 7,, /,ˆ} Every polynomial can be described by a finite string over. e.g. xˆ3 1/4xˆ2 + 6x 22/7 So Q[x] i.e. Q[x] apple
44 The CS method for showing a set is countable CS method to show a set A is countable ( A apple N ) : Show A apple for some alphabet. i.e. A i.e. Show that you can encode the elements of using finite length words over an alphabet. A
45 Seems like every set is countable Nope!
46 Cantor s Theorem Theorem: For any non-empty set A, A < P(A). S = {1, 2, 3} P(S) ={;, {1}, {2}, {3}, {1, 2}, {2, 3}, {1, 3}, {1, 2, 3}} P(S) = 2 S P(S) ${0, 1} S S = {1, 2, 3} binary strings of length S 1 0 1! {1, 3} 0 0 0! ;
47 Cantor s Theorem Theorem: For any non-empty set A, A < P(A). So: N < P(N). I.e. P(N) is uncountable. N < P(N) < P(P(N)) < P(P(P(N))) < (an infinity of infinities)
48 Cantor s Theorem - Proof by diagonalization Assume P(A) apple A for some set A. So A P(A). Let f be such a surjection. Example 1 N P(N) {3, 7, 9} {2, 5} {1, 2, 3} Define S = {a 2 A : a/2 f(a)} 2P(A). Since f is a surjection, 9s 2 A s.t. f(s) =S. But this leads to a contradiction: if s 2 S then s 62 f(s) =S if s/2 S then s 2 f(s) =S s S S = {1, 4,...} Is s 2 S? Why is this called a diagonalization argument?
49 Cantor s Theorem - Proof by diagonalization Example 1 {3, 7, 9} N P(N) 2 3 {2, 5} {1, 2, 3} S = {1, 4,...} 4... f(1) f(2) f(3) f(4) f(5). f(s)= S S is defined so that S cannot equal any f(i)
50 Let {0, 1} 1 Uncountable sets be the set of binary strings of infinite length. {0,1,2,3,4,5,6,7,8,9, } ! ;! N! {even natural numbers} {0, 1} 1 is uncountable, i.e. {0, 1} 1 > N because {0, 1} 1 $P(N). (just like {0, 1} S $P(S) ) (Recall {0, 1} is countable.)
51 Let {0, 1} Uncountable sets be the set of binary strings of infinite length. {0, 1} 1 is uncountable, i.e. {0, 1} 1 > N Direct diagonal proof: Suppose {0, 1} 1 apple N N {0, 1} 1 > cannot appear in the list
52 Uncountable sets R is uncountable. In fact (0, 1) is uncountable. exercise Be careful: =
53 Appreciating the diagonalization argument If you want to appreciate something, try to break it Exercise: Why doesn t the diagonalization argument work for N, {0, 1}, a countable subset of {0, 1} 1?
54 Uncountable sets Let be the set of bijections from to. B N N B is uncountable. CS method to show a set A is uncountable ( A > N ) : Show A {0, 1} 1 i.e. A {0, 1} 1 i.e. Show that the elements of A encode all the elements of {0, 1} 1.
55 One slide guide to countability questions You are given a set A. Is it countable or uncountable? A apple N or A > N? A apple N : - show directly that A,! N or - show A apple B, where A > N : N A B 2{Z, Z Z, Q,, Q[x]} - show directly using a diagonalization argument - show A {0, 1} 1
56 An Interesting Question Is there a set S such that N < S < P(N)? Continuum Hypothesis: No such set exists. (Hilbert s 1st problem)
57 The story continues next lecture
MATH 3300 Test 1. Name: Student Id:
Name: Student Id: There are nine problems (check that you have 9 pages). Solutions are expected to be short. In the case of proofs, one or two short paragraphs should be the average length. Write your
More informationUndecidability. Andreas Klappenecker. [based on slides by Prof. Welch]
Undecidability Andreas Klappenecker [based on slides by Prof. Welch] 1 Sources Theory of Computing, A Gentle Introduction, by E. Kinber and C. Smith, Prentice-Hall, 2001 Automata Theory, Languages and
More informationCITS2211 Discrete Structures (2017) Cardinality and Countability
CITS2211 Discrete Structures (2017) Cardinality and Countability Highlights What is cardinality? Is it the same as size? Types of cardinality and infinite sets Reading Sections 45 and 81 84 of Mathematics
More informationDiscrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 27
CS 70 Discrete Mathematics for CS Spring 007 Luca Trevisan Lecture 7 Infinity and Countability Consider a function f that maps elements of a set A (called the domain of f ) to elements of set B (called
More informationFunctions. Definition 1 Let A and B be sets. A relation between A and B is any subset of A B.
Chapter 4 Functions Definition 1 Let A and B be sets. A relation between A and B is any subset of A B. Definition 2 Let A and B be sets. A function from A to B is a relation f between A and B such that
More informationCSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Define and compute the cardinality of a set. Use functions to compare the sizes of sets. Classify sets
More informationCSE 311: Foundations of Computing. Lecture 26: Cardinality
CSE 311: Foundations of Computing Lecture 26: Cardinality Cardinality and Computability Computers as we know them grew out of a desire to avoid bugs in mathematical reasoning A brief history of reasoning
More informationOne-to-one functions and onto functions
MA 3362 Lecture 7 - One-to-one and Onto Wednesday, October 22, 2008. Objectives: Formalize definitions of one-to-one and onto One-to-one functions and onto functions At the level of set theory, there are
More informationCountability. 1 Motivation. 2 Counting
Countability 1 Motivation In topology as well as other areas of mathematics, we deal with a lot of infinite sets. However, as we will gradually discover, some infinite sets are bigger than others. Countably
More informationCardinality and ordinal numbers
Cardinality and ordinal numbers The cardinality A of a finite set A is simply the number of elements in it. When it comes to infinite sets, we no longer can speak of the number of elements in such a set.
More information1 Reals are Uncountable
CS 30: Discrete Math in CS (Winter 2019): Lecture 6 Date: 11th January, 2019 (Friday) Topic: Uncountability and Undecidability Disclaimer: These notes have not gone through scrutiny and in all probability
More informationMath 3361-Modern Algebra Lecture 08 9/26/ Cardinality
Math 336-Modern Algebra Lecture 08 9/26/4. Cardinality I started talking about cardinality last time, and you did some stuff with it in the Homework, so let s continue. I said that two sets have the same
More informationADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS
ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS 1. Cardinal number of a set The cardinal number (or simply cardinal) of a set is a generalization of the concept of the number of elements
More informationDefinition: Let S and T be sets. A binary relation on SxT is any subset of SxT. A binary relation on S is any subset of SxS.
4 Functions Before studying functions we will first quickly define a more general idea, namely the notion of a relation. A function turns out to be a special type of relation. Definition: Let S and T be
More informationThe Different Sizes of Infinity
The Different Sizes of Infinity New York City College of Technology Cesar J. Rodriguez November 11, 2010 A Thought to Ponder At... Does Infinity Come in Varying Sizes? 2 Points of Marked Interest(s) General
More informationToday. Wrapup of Polynomials...and modular arithmetic. Coutability and Uncountability.
Today. Wrapup of Polynomials...and modular arithmetic. Coutability and Uncountability. Reed-Solomon code. Problem: Communicate n packets m 1,...,m n on noisy channel that corrupts k packets. Reed-Solomon
More informationCSE 311: Foundations of Computing. Lecture 26: More on Limits of FSMs, Cardinality
CSE 311: Foundations of Computing Lecture 26: More on Limits of FSMs, Cardinality Last time: Languages and Representations All Context-Free??? Prove there is Regular a context-free DFA language 0* NFA
More informationReed-Solomon code. P(n + 2k)
Reed-Solomon code. Problem: Communicate n packets m 1,...,m n on noisy channel that corrupts k packets. Reed-Solomon Code: 1. Make a polynomial, P(x) of degree n 1, that encodes message: coefficients,
More informationChapter 20. Countability The rationals and the reals. This chapter covers infinite sets and countability.
Chapter 20 Countability This chapter covers infinite sets and countability. 20.1 The rationals and the reals You re familiar with three basic sets of numbers: the integers, the rationals, and the reals.
More informationSome. AWESOME Great Theoretical Ideas in Computer Science about Generating Functions Probability
15-251 Some AWESOME Great Theoretical Ideas in Computer Science about Generating Functions Probability 15-251 Some AWESOME Great Theoretical Ideas in Computer Science about Generating Functions Infinity
More informationMathematics 220 Workshop Cardinality. Some harder problems on cardinality.
Some harder problems on cardinality. These are two series of problems with specific goals: the first goal is to prove that the cardinality of the set of irrational numbers is continuum, and the second
More information1 Partitions and Equivalence Relations
Today we re going to talk about partitions of sets, equivalence relations and how they are equivalent. Then we are going to talk about the size of a set and will see our first example of a diagonalisation
More information5 Set Operations, Functions, and Counting
5 Set Operations, Functions, and Counting Let N denote the positive integers, N 0 := N {0} be the non-negative integers and Z = N 0 ( N) the positive and negative integers including 0, Q the rational numbers,
More information16.1 Countability. CS125 Lecture 16 Fall 2014
CS125 Lecture 16 Fall 2014 16.1 Countability Proving the non-existence of algorithms for computational problems can be very difficult. Indeed, we do not know how to prove P NP. So a natural question is
More informationMath 300: Final Exam Practice Solutions
Math 300: Final Exam Practice Solutions 1 Let A be the set of all real numbers which are zeros of polynomials with integer coefficients: A := {α R there exists p(x) = a n x n + + a 1 x + a 0 with all a
More informationECS 120 Lesson 18 Decidable Problems, the Halting Problem
ECS 120 Lesson 18 Decidable Problems, the Halting Problem Oliver Kreylos Friday, May 11th, 2001 In the last lecture, we had a look at a problem that we claimed was not solvable by an algorithm the problem
More informationCSCI3390-Lecture 6: An Undecidable Problem
CSCI3390-Lecture 6: An Undecidable Problem September 21, 2018 1 Summary The language L T M recognized by the universal Turing machine is not decidable. Thus there is no algorithm that determines, yes or
More informationNotes on ordinals and cardinals
Notes on ordinals and cardinals Reed Solomon 1 Background Terminology We will use the following notation for the common number systems: N = {0, 1, 2,...} = the natural numbers Z = {..., 2, 1, 0, 1, 2,...}
More informationProf. Ila Varma HW 8 Solutions MATH 109. A B, h(i) := g(i n) if i > n. h : Z + f((i + 1)/2) if i is odd, g(i/2) if i is even.
1. Show that if A and B are countable, then A B is also countable. Hence, prove by contradiction, that if X is uncountable and a subset A is countable, then X A is uncountable. Solution: Suppose A and
More information1 of 8 7/15/2009 3:43 PM Virtual Laboratories > 1. Foundations > 1 2 3 4 5 6 7 8 9 6. Cardinality Definitions and Preliminary Examples Suppose that S is a non-empty collection of sets. We define a relation
More informationMAGIC Set theory. lecture 1
MAGIC Set theory lecture 1 David Asperó University of East Anglia 15 October 2014 Welcome Welcome to this set theory course. This will be a 10 hour introduction to set theory. The only prerequisite is
More information1.4 Cardinality. Tom Lewis. Fall Term Tom Lewis () 1.4 Cardinality Fall Term / 9
1.4 Cardinality Tom Lewis Fall Term 2006 Tom Lewis () 1.4 Cardinality Fall Term 2006 1 / 9 Outline 1 Functions 2 Cardinality 3 Cantor s theorem Tom Lewis () 1.4 Cardinality Fall Term 2006 2 / 9 Functions
More information2 Exercises 1. The following represent graphs of functions from the real numbers R to R. Decide which are one-to-one, which are onto, which are neithe
Infinity and Counting 1 Peter Trapa September 28, 2005 There are 10 kinds of people in the world: those who understand binary, and those who don't. Welcome to the rst installment of the 2005 Utah Math
More informationWarm-Up Problem. Please fill out your Teaching Evaluation Survey! Please comment on the warm-up problems if you haven t filled in your survey yet.
Warm-Up Problem Please fill out your Teaching Evaluation Survey! Please comment on the warm-up problems if you haven t filled in your survey yet Warm up: Given a program that accepts input, is there an
More informationSets are one of the basic building blocks for the types of objects considered in discrete mathematics.
Section 2.1 Introduction Sets are one of the basic building blocks for the types of objects considered in discrete mathematics. Important for counting. Programming languages have set operations. Set theory
More informationSection Summary. Sequences. Recurrence Relations. Summations. Examples: Geometric Progression, Arithmetic Progression. Example: Fibonacci Sequence
Section 2.4 1 Section Summary Sequences. Examples: Geometric Progression, Arithmetic Progression Recurrence Relations Example: Fibonacci Sequence Summations 2 Introduction Sequences are ordered lists of
More informationMath 4603: Advanced Calculus I, Summer 2016 University of Minnesota Notes on Cardinality of Sets
Math 4603: Advanced Calculus I, Summer 2016 University of Minnesota Notes on Cardinality of Sets Introduction In this short article, we will describe some basic notions on cardinality of sets. Given two
More informationUnderstanding Computation
Understanding Computation 1 Mathematics & Computation -Mathematics has been around for a long time as a method of computing. -Efforts to find canonical way of computations. - Machines have helped with
More informationMATH 201 Solutions: TEST 3-A (in class)
MATH 201 Solutions: TEST 3-A (in class) (revised) God created infinity, and man, unable to understand infinity, had to invent finite sets. - Gian Carlo Rota Part I [5 pts each] 1. Let X be a set. Define
More informationIntro to Theory of Computation
Intro to Theory of Computation LECTURE 15 Last time Decidable languages Designing deciders Today Designing deciders Undecidable languages Diagonalization Sofya Raskhodnikova 3/1/2016 Sofya Raskhodnikova;
More information15-251: Great Theoretical Ideas in Computer Science Lecture 7. Turing s Legacy Continues
15-251: Great Theoretical Ideas in Computer Science Lecture 7 Turing s Legacy Continues Solvable with Python = Solvable with C = Solvable with Java = Solvable with SML = Decidable Languages (decidable
More informationS15 MA 274: Exam 3 Study Questions
S15 MA 274: Exam 3 Study Questions You can find solutions to some of these problems on the next page. These questions only pertain to material covered since Exam 2. The final exam is cumulative, so you
More information15-251: Great Theoretical Ideas in Computer Science Fall 2016 Lecture 6 September 15, Turing & the Uncomputable
15-251: Great Theoretical Ideas in Computer Science Fall 2016 Lecture 6 September 15, 2016 Turing & the Uncomputable Comparing the cardinality of sets A B if there is an injection (one-to-one map) from
More informationSETS AND FUNCTIONS JOSHUA BALLEW
SETS AND FUNCTIONS JOSHUA BALLEW 1. Sets As a review, we begin by considering a naive look at set theory. For our purposes, we define a set as a collection of objects. Except for certain sets like N, Z,
More informationCSE 311: Foundations of Computing. Lecture 26: Cardinality, Uncomputability
CSE 311: Foundations of Computing Lecture 26: Cardinality, Uncomputability Last time: Languages and Representations All 0*? Context-Free e.g. palindromes, balanced parens, {0 n 1 n :n 0} Regular Finite
More informationSection 7.5: Cardinality
Section 7: Cardinality In this section, we shall consider extend some of the ideas we have developed to infinite sets One interesting consequence of this discussion is that we shall see there are as many
More informationLecture Notes: The Halting Problem; Reductions
Lecture Notes: The Halting Problem; Reductions COMS W3261 Columbia University 20 Mar 2012 1 Review Key point. Turing machines can be encoded as strings, and other Turing machines can read those strings
More informationDiscrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 20. To Infinity And Beyond: Countability and Computability
EECS 70 Discrete Mathematics and Probability Theory Spring 014 Anant Sahai Note 0 To Infinity And Beyond: Countability and Computability This note ties together two topics that might seem like they have
More information1 Showing Recognizability
CSCC63 Worksheet Recognizability and Decidability 1 1 Showing Recognizability 1.1 An Example - take 1 Let Σ be an alphabet. L = { M M is a T M and L(M) }, i.e., that M accepts some string from Σ. Prove
More informationDiscrete Mathematics 2007: Lecture 5 Infinite sets
Discrete Mathematics 2007: Lecture 5 Infinite sets Debrup Chakraborty 1 Countability The natural numbers originally arose from counting elements in sets. There are two very different possible sizes for
More informationCSE 20 Discrete Math. Winter, January 24 (Day 5) Number Theory. Instructor: Neil Rhodes. Proving Quantified Statements
CSE 20 Discrete Math Proving Quantified Statements Prove universal statement: x D, P(x)Q(x) Exhaustive enumeration Generalizing from the generic particular Winter, 2006 Suppose x is in D and P(x) Therefore
More information6 CARDINALITY OF SETS
6 CARDINALITY OF SETS MATH10111 - Foundations of Pure Mathematics We all have an idea of what it means to count a finite collection of objects, but we must be careful to define rigorously what it means
More informationINFINITY: CARDINAL NUMBERS
INFINITY: CARDINAL NUMBERS BJORN POONEN 1 Some terminology of set theory N := {0, 1, 2, 3, } Z := {, 2, 1, 0, 1, 2, } Q := the set of rational numbers R := the set of real numbers C := the set of complex
More informationCS 125 Section #10 (Un)decidability and Probability November 1, 2016
CS 125 Section #10 (Un)decidability and Probability November 1, 2016 1 Countability Recall that a set S is countable (either finite or countably infinite) if and only if there exists a surjective mapping
More informationA non-turing-recognizable language
CS 360: Introduction to the Theory of Computing John Watrous, University of Waterloo A non-turing-recognizable language 1 OVERVIEW Thus far in the course we have seen many examples of decidable languages
More informationACS2: Decidability Decidability
Decidability Bernhard Nebel and Christian Becker-Asano 1 Overview An investigation into the solvable/decidable Decidable languages The halting problem (undecidable) 2 Decidable problems? Acceptance problem
More informationSelected problems from past exams
Discrete Structures CS2800 Prelim 1 s Selected problems from past exams 1. True/false. For each of the following statements, indicate whether the statement is true or false. Give a one or two sentence
More informationEconomics 204 Summer/Fall 2017 Lecture 1 Monday July 17, 2017
Economics 04 Summer/Fall 07 Lecture Monday July 7, 07 Section.. Methods of Proof We begin by looking at the notion of proof. What is a proof? Proof has a formal definition in mathematical logic, and a
More informationMath.3336: Discrete Mathematics. Cardinality of Sets
Math.3336: Discrete Mathematics Cardinality of Sets Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu Fall 2018
More informationDiscrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009
Discrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009 Our main goal is here is to do counting using functions. For that, we
More informationMATH 13 FINAL EXAM SOLUTIONS
MATH 13 FINAL EXAM SOLUTIONS WINTER 2014 Problem 1 (15 points). For each statement below, circle T or F according to whether the statement is true or false. You do NOT need to justify your answers. T F
More informationAlgorithms: Lecture 2
1 Algorithms: Lecture 2 Basic Structures: Sets, Functions, Sequences, and Sums Jinwoo Kim jwkim@jjay.cuny.edu 2.1 Sets 2 1 2.1 Sets 3 2.1 Sets 4 2 2.1 Sets 5 2.1 Sets 6 3 2.1 Sets 7 2.2 Set Operations
More informationABOUT THE CLASS AND NOTES ON SET THEORY
ABOUT THE CLASS AND NOTES ON SET THEORY About the Class Evaluation. Final grade will be based 25%, 25%, 25%, 25%, on homework, midterm 1, midterm 2, final exam. Exam dates. Midterm 1: Oct 4. Midterm 2:
More informationNotes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.
Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3
More informationComputational Models Lecture 8 1
Computational Models Lecture 8 1 Handout Mode Nachum Dershowitz & Yishay Mansour. Tel Aviv University. May 17 22, 2017 1 Based on frames by Benny Chor, Tel Aviv University, modifying frames by Maurice
More informationA Universal Turing Machine
A Universal Turing Machine A limitation of Turing Machines: Turing Machines are hardwired they execute only one program Real Computers are re-programmable Solution: Universal Turing Machine Attributes:
More informationTuring Machines, diagonalization, the halting problem, reducibility
Notes on Computer Theory Last updated: September, 015 Turing Machines, diagonalization, the halting problem, reducibility 1 Turing Machines A Turing machine is a state machine, similar to the ones we have
More informationSolutions to Tutorial for Week 4
The University of Sydney School of Mathematics and Statistics Solutions to Tutorial for Week 4 MATH191/1931: Calculus of One Variable (Advanced) Semester 1, 018 Web Page: sydneyeduau/science/maths/u/ug/jm/math191/
More informationMath 105A HW 1 Solutions
Sect. 1.1.3: # 2, 3 (Page 7-8 Math 105A HW 1 Solutions 2(a ( Statement: Each positive integers has a unique prime factorization. n N: n = 1 or ( R N, p 1,..., p R P such that n = p 1 p R and ( n, R, S
More informationIntroduction to the Theory of Computing
Introduction to the Theory of Computing Lecture notes for CS 360 John Watrous School of Computer Science and Institute for Quantum Computing University of Waterloo June 27, 2017 This work is licensed under
More informationAnnouncements. CS243: Discrete Structures. Sequences, Summations, and Cardinality of Infinite Sets. More on Midterm. Midterm.
Announcements CS43: Discrete Structures Sequences, Summations, and Cardinality of Infinite Sets Işıl Dillig Homework is graded, scores on Blackboard Graded HW and sample solutions given at end of this
More informationCSE 4111/5111/6111 Computability Jeff Edmonds Assignment 3: Diagonalization & Halting Problem Due: One week after shown in slides
CSE 4111/5111/6111 Computability Jeff Edmonds Assignment 3: Diagonalization & Halting Problem Due: One week after shown in slides First Person: Second Person: Family Name: Family Name: Given Name: Given
More informationThe cardinal comparison of sets
(B) The cardinal comparison of sets I think we can agree that there is some kind of fundamental difference between finite sets and infinite sets. For a finite set we can count its members and so give it
More informationMath 455 Some notes on Cardinality and Transfinite Induction
Math 455 Some notes on Cardinality and Transfinite Induction (David Ross, UH-Manoa Dept. of Mathematics) 1 Cardinality Recall the following notions: function, relation, one-to-one, onto, on-to-one correspondence,
More informationLecture 3: Sizes of Infinity
Math/CS 20: Intro. to Math Professor: Padraic Bartlett Lecture 3: Sizes of Infinity Week 2 UCSB 204 Sizes of Infinity On one hand, we know that the real numbers contain more elements than the rational
More informationWeek Some Warm-up Questions
1 Some Warm-up Questions Week 1-2 Abstraction: The process going from specific cases to general problem. Proof: A sequence of arguments to show certain conclusion to be true. If... then... : The part after
More informationCS103 Handout 08 Spring 2012 April 20, 2012 Problem Set 3
CS103 Handout 08 Spring 2012 April 20, 2012 Problem Set 3 This third problem set explores graphs, relations, functions, cardinalities, and the pigeonhole principle. This should be a great way to get a
More informationWhat is proof? Lesson 1
What is proof? Lesson The topic for this Math Explorer Club is mathematical proof. In this post we will go over what was covered in the first session. The word proof is a normal English word that you might
More informationFinite and Infinite Sets
Chapter 9 Finite and Infinite Sets 9. Finite Sets Preview Activity (Equivalent Sets, Part ). Let A and B be sets and let f be a function from A to B..f W A! B/. Carefully complete each of the following
More informationLecture Notes 1 Basic Concepts of Mathematics MATH 352
Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,
More informationCMU , Spring 2018 Great Ideas in Theoretical Computer Science. Course Notes: Condensed 2
CMU 15-251, Spring 2018 Great Ideas in Theoretical Computer Science Course Notes: Condensed 2 April 4, 2018 Please send comments and corrections to Anil Ada (aada@cs.cmu.edu). Foreword These notes are
More informationCardinality of Sets. P. Danziger
MTH 34-76 Cardinality of Sets P Danziger Cardinal vs Ordinal Numbers If we look closely at our notions of number we will see that in fact we have two different ways of conceiving of numbers The first is
More informationCSCE 551: Chin-Tser Huang. University of South Carolina
CSCE 551: Theory of Computation Chin-Tser Huang huangct@cse.sc.edu University of South Carolina Church-Turing Thesis The definition of the algorithm came in the 1936 papers of Alonzo Church h and Alan
More informationNotes on counting. James Aspnes. December 13, 2010
Notes on counting James Aspnes December 13, 2010 1 What counting is Recall that in set theory we formally defined each natural number as the set of all smaller natural numbers, so that n = {0, 1, 2,...,
More informationComputational Models Lecture 8 1
Computational Models Lecture 8 1 Handout Mode Ronitt Rubinfeld and Iftach Haitner. Tel Aviv University. May 11/13, 2015 1 Based on frames by Benny Chor, Tel Aviv University, modifying frames by Maurice
More informationLogic and Mathematics:
Logic and Mathematics: Mathematicians in Schools Program Lashi Bandara Mathematical Sciences Institute, Australian National University April 21, 2011 Contents 1 Russell s Paradox 1 2 Propositional Logic
More informationDiscrete Structures - CM0246 Cardinality
Discrete Structures - CM0246 Cardinality Andrés Sicard-Ramírez Universidad EAFIT Semester 2014-2 Cardinality Definition (Cardinality (finite sets)) Let A be a set. The number of (distinct) elements in
More informationA Short Review of Cardinality
Christopher Heil A Short Review of Cardinality November 14, 2017 c 2017 Christopher Heil Chapter 1 Cardinality We will give a short review of the definition of cardinality and prove some facts about the
More informationBasic set-theoretic techniques in logic Part II, Counting beyond infinity: Ordinal numbers
Basic set-theoretic techniques in logic Part II, Counting beyond infinity: Ordinal numbers Benedikt Löwe Universiteit van Amsterdam Grzegorz Plebanek Uniwersytet Wroc lawski ESSLLI, Ljubliana August 2011
More informationCSE 311: Foundations of Computing. Lecture 27: Undecidability
CSE 311: Foundations of Computing Lecture 27: Undecidability Last time: Countable sets A set is countable iff we can order the elements of as = {,,, Countable sets: N-the natural numbers Z - the integers
More informationDiscrete Structures for Computer Science
Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #10: Sequences and Summations Based on materials developed by Dr. Adam Lee Today s Topics Sequences
More informationCSE 105 THEORY OF COMPUTATION
CSE 105 THEORY OF COMPUTATION "Winter" 2018 http://cseweb.ucsd.edu/classes/wi18/cse105-ab/ Today's learning goals Sipser Ch 4.2 Trace high-level descriptions of algorithms for computational problems. Use
More informationSets and Functions. (As we will see, in describing a set the order in which elements are listed is irrelevant).
Sets and Functions 1. The language of sets Informally, a set is any collection of objects. The objects may be mathematical objects such as numbers, functions and even sets, or letters or symbols of any
More information3. Only sequences that were formed by using finitely many applications of rules 1 and 2, are propositional formulas.
1 Chapter 1 Propositional Logic Mathematical logic studies correct thinking, correct deductions of statements from other statements. Let us make it more precise. A fundamental property of a statement is
More informationCS 121, Section 2. Week of September 16, 2013
CS 121, Section 2 Week of September 16, 2013 1 Concept Review 1.1 Overview In the past weeks, we have examined the finite automaton, a simple computational model with limited memory. We proved that DFAs,
More informationCSE 322, Fall 2010 Nonregular Languages
Cardinality CSE 322, Fall 2010 Nonregular Languages Two sets have equal cardinality if there is a bijection ( 1-to-1 and onto function) between them A set is countable if it is finite or has the same cardinality
More informationMATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017
MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017 Definition: A set A is finite if there exists a nonnegative integer c such that there exists a bijection from A
More informationAssignments. Math 215. Fall 2009.
Assignments. Math 215. Fall 2009. 1. Assignment Number One. Due Wednesday, September 2, 2009. Eccles. Read Chapters 1,2,3. (a) page 9. 1.4, 1.5 (b) page 19. 2.1, 2.3, 2.4, 2.5, 2.6 (c) Using definitions
More informationMath 127 Homework. Mary Radcliffe. Due 29 March Complete the following problems. Fully justify each response.
Math 17 Homework Mary Radcliffe Due 9 March 018 Complete the following problems Fully justify each response NOTE: due to the Spring Break, this homework set is a bit longer than is typical You only need
More informationBasic counting techniques. Periklis A. Papakonstantinou Rutgers Business School
Basic counting techniques Periklis A. Papakonstantinou Rutgers Business School i LECTURE NOTES IN Elementary counting methods Periklis A. Papakonstantinou MSIS, Rutgers Business School ALL RIGHTS RESERVED
More information