Ackermann Function
978-613-0-80447-3
6130804474
80
2010-07-25
34.00 €
eng
https://images.our-assets.com/cover/230x230/9786130804473.jpg
https://images.our-assets.com/fullcover/230x230/9786130804473.jpg
https://images.our-assets.com/cover/2000x/9786130804473.jpg
https://images.our-assets.com/fullcover/2000x/9786130804473.jpg
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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.
https://morebooks.de/books/ru/published_by/alphascript-publishing/2/products
Анализ
https://morebooks.de/store/ru/book/ackermann-function/isbn/978-613-0-80447-3