EGAVE

primitive recursion

About 0.01 uses per million words.

Meaning

  1. noun Recursion to a fixed depth.
  2. noun The operator ρ that creates a new function from two functions g and h such that: ρ(g,h)(0,x1,…,xk)=g(x1,…,xk)ρ(g,h)(y+1,x1,…,xk)=h(y,ρ(g,h)(y,x1,…,xk),x1,…,xk).

Similar words

infinite recursion recursion recursive descent recursion theory computability theory kleene's recursion theorem base case recursive definition tree corecursion

Save “primitive recursion” to learn later