Question

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

Answer 1

I do not understand what you are asking.

Answer 2

we need to prove that this function primitiv recursiv is, its actually formal language question, its a little bit strange

Answer 3

I am sorry that I am not familiar with this topic.

Answer 4

ok no problem mr Saab, thanks that you have looked on it

Answer 5

http://en.wikipedia.org/wiki/Primitive_recursive_function