In computability theory, the Ackermann function, named after Wilhelm Ackermann, is one of the simplest and earliest-discovered examples of a total computable function that is not primitive recursive. All primitive recursive functions are total and computable, but the Ackermann function illustrates that not all total computable functions are primitive recursive. Continue reading “Ackermann’s function”
What is Recursion?
Definition: Recursion is a process in which a function calls itself as a subroutine.
The function itself that use the process of recursion is called a recursive function. Continue reading “Recursion”