👉 Ackermann's function, also known as Ackermann's principle, is a mathematical concept in computability theory. It is named after Kurt Gödel and Wilhelm Ackermann, who independently discovered it in 1930s.
It is a recursive function that can compute any number of arguments up to three using only addition and multiplication (in any order). The definition for this function is as follows:
Let M be an integer greater than or equal to 2. Let n be a natural number
ack