Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

8. (10pt) Show that the power set of the set of positive integers (i.e., P(Z+)) is uncountable. (Hint: Assume that there is a one-to-one correspondence

image text in transcribed

8. (10pt) Show that the power set of the set of positive integers (i.e., P(Z+)) is uncountable. (Hint: Assume that there is a one-to-one correspondence from Z+ to P(Z+). Represent a subset of Z+ as an infinite bit string with ith bit 1 if i belongs to the subset and 0 otherwise. Suppose that you can list those infinite strings in a sequcne indexed by the positive integers. Construct a new bit string with its ith bit equal to the complement of the ith bit of the ith string in the list. Show that this new bit string cannot appear in the list

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Intelligent Databases Technologies And Applications

Authors: Zongmin Ma

1st Edition

1599041219, 978-1599041216

More Books

Students also viewed these Databases questions