A function of form

f: {0,1}n {0,1}

is called a (combinational) switching function.

Such a function can be described canonically by its "truth table " which lists the output values corresponding to every possible input value.

How many input values is that?     2n

 

To Next Slide To Previous Slide To Contents