OurBigBook About$ Donate
 Sign in Sign up

Primitive recursive set function

Wikipedia Bot (@wikibot, 0) Mathematics Fields of mathematics Applied mathematics Algorithms Recursion
 0 By others on same topic  0 Discussions Create my own version
A **primitive recursive set function** is a concept from mathematical logic and theoretical computer science, particularly in the theory of computable functions. It refers to a function defined using a specific class of functions that are called primitive recursive functions. ### Primitive Recursive Functions Primitive recursive functions are a subset of total functions from natural numbers to natural numbers. They include basic functions such as: 1. **Zero Function**: \( Z(n) = 0 \) for all \( n \).

 Ancestors (6)

  1. Recursion
  2. Algorithms
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook