9. Examples and Exercises

Two Examples:

The previous proof is "constructive" in that it actually provides us with an algorithm that allows us to "compute" MATH from $\QTR{Large}{f}$ and $\QTR{Large}{g}$ Here are two simple examples:

1.

MATH and MATH and MATH

Start with

MATH

MATH

MATH

MATH

MATH

$.$

MATH

Hence, by "induction"

MATH Verify that this works. That is MATH.

Now, define MATH on MATH, and MATH on MATH

2.

MATH and MATH and MATH

MATH

MATH

MATH

MATH

MATH

MATH

MATH

MATH

MATH

Hence, again by "induction"

MATH Verify that MATH.

Exercise:

The Warmup.

MATH , MATH and MATH

The Challenge:

MATH

$\QTR{Large}{f(m)=}$ MATH

$\vspace{1pt}$and

MATH