# Category:Primitive Recursive Functions

Jump to navigation
Jump to search

This category contains results about Primitive Recursive Functions.

Definitions specific to this category can be found in Definitions/Primitive Recursive Functions.

A function is **primitive recursive** if it can be obtained from basic primitive recursive functions using the operations of substitution and primitive recursion a finite number of times.

## Pages in category "Primitive Recursive Functions"

The following 53 pages are in this category, out of 53 total.

### B

### C

### D

### M

### N

### P

- Permutation of Variables of Primitive Recursive Function
- Predecessor Function is Primitive Recursive
- Prime Enumeration Function is Primitive Recursive
- Prime Exponent Function is Primitive Recursive
- Primitive Recursive Function is Total Recursive Function
- Primitive Recursive Function is URM Computable
- Primitive Recursive Relation is URM Computable
- Primitive Recursive Set is URM Computable

### S

- Set Containing Only Zero is Primitive Recursive
- Set of Codes for URM Instructions is Primitive Recursive
- Set of Codes for URM Programs is Primitive Recursive
- Set of Even Numbers is Primitive Recursive
- Set of Natural Numbers is Primitive Recursive
- Set of Non-Zero Natural Numbers is Primitive Recursive
- Set of Prime Numbers is Primitive Recursive
- Set of Sequence Codes is Primitive Recursive
- Set Operations on Primitive Recursive Relations
- Signum Function is Primitive Recursive
- Single Instruction URM Programs
- Single Instruction URM Programs/Identity Function
- Single Instruction URM Programs/Projection Function
- Single Instruction URM Programs/Successor Function
- Single Instruction URM Programs/Zero Function
- State Code Function is Primitive Recursive
- Substitution of Constant yields Primitive Recursive Function