CS4123 Theory of Computation. B97

Prof. Carolina Ruiz
Department of Computer Science
Worcester Polytechnic Institute

Homework 3

• Problems/Exercises from the Textbook:
  4.3, 4.5, 4.7, 4.8, 4.17, 4.19, 4.21

• Primitive recursive functions:
  1. Write a C program that implements the function "prime(n)" AS YOU DEFINED IT in Quiz 3. (Quiz3 will be returned on Friday)

  2. Run your program for each of the following inputs:

     Input:
     0
     1
     2
     7
     8
     35
     101
     17

  3. Hand in a printout of your program and the output produced by your program for the inputs above

  4. If your program does not work, rewrite it until you obtain a correct implementation of the "prime" function.

  5. Show that your correct implementation is primitive recursive.

• ADDITIONAL PROBLEMS FOR STUDENTS TAKING THIS COURSE FOR GRADUATE CREDIT: Problems/Exercises from the Textbook: 4.15, 4.18, 4.22