Ask your own question, for FREE!
MIT 6.00 Intro Computer Science (OCW) 25 Online
OpenStudy (anonymous):

Show that the function \[equals(m,n) = \left\{ \begin{array}{ll} 1 & \mbox{if $m = n$};\\ 0 & \mbox{else }.\end{array} \right.\] primitiv recursiv is

OpenStudy (anonymous):

def equals(m,n): if m==n: return 1 else: return 0

OpenStudy (anonymous):

thanks

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!