High Quality Content by WIKIPEDIA articles! In computability theory, the Ackermann function or Ackermann–Peter 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.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.