Proving completeness

You are given a set of operators. You are asked to show that you can implement any function using these operators. The simplest way to do this is to show that the set of operators you are given reduces reduces to a set of operators that we already know is complete, for example {NOT, AND, OR}.

This means we have to show how to implement NOT, AND and OR using only the operators in the set you are given.

You are given a set of operators. You are asked to show that you can implement any function using these operators. The simplest way to do this is to show that the set of operators you are given reduces reduces to a set of operators that we already know is complete, for example {NOT, AND, OR}.