CSC165H1 Lecture Notes - Natural Number, Mathematical Induction

49 views4 pages
cherryberry1035 and 38883 others unlocked
CSC165H1 Full Course Notes
3
CSC165H1 Full Course Notes
Verified Note
3 documents

Document Summary

Fall 2011: prove or disprove that the set s0 = {f : z z} is countable. Intuitively, each element of s0 consists of an in nite amount of information, so we expect that s0 is not countable. To show this by diagonalization involves the following steps: (a) describe a representation for every element of s0 that is unique to each element (i. e. , di erent representations correspond to di erent elements). By listing its values: f (z0), f (z1), f (z2), . Di erent functions correspond to di erent lists of values, and every list of values is a function. In other words, there is a list f0, f1, f2, . , fk, . that contains every function in s0. Consider the function f represented by the following list of values: f0(z0) + 1, f1(z1) + 1, f2(z2) + 1, .

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers
Class+
$8 USD/m
Billed $96 USD annually
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
30 Verified Answers

Related Documents

Related Questions