PR (complexity)
PR is the complexity class containing all formal languages that can be decided by a primitive recursive function.
PR is the complexity class containing all formal languages that can be decided by a primitive recursive function.
| Considered feasible | |
|---|---|
| Suspected infeasible | |
| Considered infeasible | |
| Class hierarchies | |
| Families of classes | |