Ackermann Function: Computability theory, Computable function, Primitive recursive function, Strict subset, Subset, Recursion -
-20% with code BOOKS
Shipping in 15-21 days
30-day return policy
High Quality Content by WIKIPEDIA articles! In computability theory, the Ackermann function or Ackermann-Péter function is a simple example of a computable function that is not primitive recursive. The set of primitive recursive functions is a subset of the set of general recursive functions. Ackermann's function is an example that shows that the former is a strict subset of the latter.
You May Also Like
Description
More Information
| Publisher | OmniScriptum |
|---|---|
| Release year | 2026 |
| Cover type | Softcover |
| EAN | 9786130804473 |