Programme Code : BCA
Course Code : cs-73
| More

Year : 2013 Views: 760 Submitted By : abhinav sharma On 15th March, 2013

Do you have solution for this Question. If yes    I aslo want solution.

Q.


Show that each of the following function is primitive recursive function.



(a) f (m, n) = 4mn

(b) fib (n), where fib (n) is defined by

fib (0) = 0

fib (1) = 1

fib ( n + 2) = fib (n) + fib (n + 1) , n ï³ 0


No Answer Found