Due Date: Thursday, January 27, 2005
1. Write down, in all necessary details, a proof that we had in the class: that there exists a function which is computable but not primitive recursive.