Half Adder gives two outputs:
We can perform any operation using Half adder if we can implement basic gates using half adder.
@Arjun Sir Is deriving AND and NOT not enough to prove that any binary function can be implemented using half adder in this case ?
So here basically we have to prove that half adder is functionally complete !! as in half adder two gates are present (for sum = XOR And for carry =AND ) .
and to prove functionally complete , either (AND ,NOT) OR (OR,NOT) must be generated.
is this logic right?
64.3k questions
77.9k answers
244k comments
80.0k users