Ackermann Function A(n,x,y) Examples

Ackermann  Function is an extreme example of Recurrence Relations and Recursive Functions. The Ackermann function was discovered and studied by Wilhelm Ackermann (1896–1962) in 1928. Ackermann worked as a high-school teacher from 1927 to 1961 but was also a student of the great mathematician David Hilbert in Göttingen and, from 1953, served as an honorary professor in the university there. Together with Hilbert he published the first modern textbook on mathematical logic. The Ackermann function can be defined as follows:   ...

Read More

Recursion function and Fibonacci series

Recursive Function: A recursive function is a function that calls itself, either directly, or indirectly. Recursion is an important topic in upper-level computer science courses. A recursive function invokes itself. A recurrence relation is a relation that is specified using itself. Anything that can be done recursively can be done iteratively and vice versa. If there were a data processing Inquisition programmers would probably be burned at the stake based on a belief or disbelief in recursion. Advantages: Code to implement an algorithm...

Read More