primitive recursion

Definition from Wiktionary, the free dictionary
Jump to: navigation, search

English[edit]

Noun[edit]

primitive recursion (countable and uncountable, plural primitive recursions)

  1. (computing theory) Recursion to a fixed depth.
  2. (computing theory) The operator that creates a new function from two functions and such that:
    .

See also[edit]