1.

Sometimes feel like content is missing from lectures, youtube format for proofs
can be hard to focus on and it's difficult because we can't ask questions directly
"in lecture".
Allowing questions and answers in the youtube comment section would be super
helpful because we could see a bank of common questions people had on each video.
We think we can improve
our comprehension of the material in discussion by spending more time discussing
questions we have among ourselves versus just presenting solutions.

2.

Show that ther is no one to one mapping from set of natural numbers to set of
inifinite
length domino chains.

3.

P is defined as the set of elements of S that are not included in the set they map
to.

If X is in P, we can conclude X does not belong to P -> False

if X is not in P, we can conclude X does belong to P -> False

The proof did not require the sets to be finite because its impossible to ever have
a surgective mapping from s to the power set of s.

It's possibl

4.
not(maj(a,b,not(one)) -> nand

nand(nand(a,b), nand(a,b)) -> and

nand(nand(a, a), nand(b,b)) -> or
5.
def IMPL(a,b):
"""TODO: Implement the boolean operator Implies which is true whenever "a
implies b" is true."""
not_a = NOT(a)
return OR(not_a, b)

def XOR_nand(a, b):

"""TODO: Implement XOR using only NAND"""
not_a = NAND(a,a)
not_b = NAND(b,b)
nand_a_not_b = NAND(a, not_b)
and_a_not_b = NAND(nand_a_not_b, nand_a_not_b)

nand_b_not_a = NAND(b, not_a)

and_b_not_a = NAND(nand_b_not_a, nand_b_not_a)

nand_a_a = NAND(and_b_not_a,and_b_not_a)
nand_b_b = NAND(and_a_not_b,and_a_not_b)
return NAND(nand_a_a, nand_b_b)
6.
Every function mapping finite binary strings to a bit can be represented by an
infinite binary string
Therefore the set of infinte binary strings is equal to the set of functions
mapping finite binary strings to bits, so their cardinalities are equal