20% off all books with the code: BOOKS
  • check 10+ million books
  • check New arrivals every day
  • check Trusted by 1M+ customers
  • check Great prices & discounts
  • check Shipping across Europe

Ackermann Function: Computability theory, Computable function, Primitive recursive function, Strict subset, Subset, Recursion -

English
2026-03-14
€156.58 €195.73

-20% with code BOOKS

In stock at our supplier

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

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.

More Information

Publisher OmniScriptum
Release year 2026
Cover type Softcover
EAN 9786130804473
Write Your Own Review
You're reviewing: Ackermann Function: Computability theory, Computable function, Primitive recursive function, Strict subset, Subset, Recursion
Your Rating:

Goodreads Reviews

€156.58 €195.73