Implementation of the Ackermann recursive Function, one of the simplest and earliest-discovered examples of a total computable function that is not primitive recursive using a C++ program.

Implementation of the Ackermann recursive Function, one of the simplest and earliest-discovered examples of a total computable function that is not primitive recursive using a C++ program.

Today we will learn about the implementation of the Ackermann recursion function using a C++ program.

The Ackermann function is named after Wilhelm Ackermann, this function is a classic example of how there can exist a function that can only be executed recursively and notable especially because it provides a counterexample that every function that is computed can be computed primitive recursively.

It is an exponential function and hence grows very quickly with every step, its complexity increases many folds as does the size of its call tree.

It is only possible to compute up to certain steps within an extended time period since the function grows so quickly. Its arguments are never negative and it always terminates.

Submitted by Kollu saisumanth (19UJ1A1222)

Download packets of source code on Coders Packet

## Comments