1. For the following, make sure you explain which basic functions in F1-F3 you are using, and how exactly you are applying the operations O1-O3.
(a) Show that every constant function g : N → N is recursive. You may need to use induction.
(b) Show that the function f : N → N such that f(x) = x 3 is primitive recursive.
Get Answers For Free
Most questions answered within 1 hours.