CS 250 Homework  - Other Formalisms

1. p332 #6

2. Show that the following can be done by the Bare-Bones Programming Language.

        if x = 0 then S1 else S2

Extra Credit. Give an example to illustrate the fact that unbounded existential quantification of a computable predicate need not be computable.