Wikipedia

Primitive recursive function: Difference between revisions

Browse history interactively
← Previous editNext edit →
Content deleted Content added
VisualWikitext
→Some common primitive recursive functions: Correct Kleene page number (reL 1971 editionn on archive.org)
Correct spacing around binary operator →Predicate "Less or equal"
Line 138:
=== Predicate "Less or equal" ===
 
Using the property <math>x \leq y \iff x \stackrelmathbin{\overset.-} y = 0</math>, the 2-ary function <math>Leq</math> can be defined by <math>Leq = IsZero \circ Sub</math>. Then <math>Leq(x,y) = 1</math> if <math>x \leq y</math>, and <math>Leq(x,y) = 0</math>, otherwise. As a computation example,
:<math>\begin{array}{lll}
& Leq(8,3) \\
Retrieved from "https://en.wikipedia.org/wiki/Primitive_recursive_function"