Ackermann (stella v0.7.1)
Ackermann function is one of the simplest example of a total computable function that is not primitive recursive.
Link to this section Summary
Link to this section Functions
Link to this function
ack(m, n)
@spec ack(non_neg_integer(), number()) :: number()
Run Ackermann function for given initials More info on Wikipedia page
examples
Examples
iex> Ackermann.ack(0, 1)
2
iex> Ackermann.ack(3, 6)
509