Next assignment from Eternity’s thread.
Here are my notes (I also made a series of truth tables/tables. Though they probably don’t make much sense, I thought I’d share.)
Alright. What do I know?
nand(x, y) = not(and(x, y))
AND and OR give the same output when both inputs are identical.
AND and OR give an opposite output when the inputs are different. Under those conditions OR is 1, and AND is 0.
or(x, y) can be converted to and(z) using only AND, NOT. ← wait thats not necessarily the case.
Okay lets work backwards. What inputs to an AND gate will give the same output as or(x, y)?
What inputs to NOT will give the same outputs as or(x, y)? 0, 0, 0, 1.
Okay, stuck on law 1. 12 mins to go. Maybe I’ll try law 2.
Give up with 6mins left.
Hmm okay, I’m giving up. I’m not going to make this in time. I think I’m getting myself a little confused. One thing I tried to work backwards from some hypothetical expression NOT(P) and asked, what would P have to be for NOT(P) to equal or(x, y), if P can only be expressed with x, y, not, and.
I’m going to not read ahead on the Eternity thread in case you have any feedback particular to my attempt.