Ackermann Function: Computability theory, Computable function, Primitive recursive function, Strict subset, Subset, Recursion -
-25% ar kodu BOOKS
Piegāde 15-21 darba dienu laikā
30 dienu atgriešanas politika
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.
Jums varētu patikt arī
Aprašymas
Vairāk informācijas
| Izdevējs | OmniScriptum |
|---|---|
| Izlaides gads | 2026 |
| Vāka tips | Mīkstais vāks |
| EAN | 9786130804473 |