@@ -1,3 +1,9 @@
1++++
2+title = "Ackermann"
3+weight = 10
4+template = "doc.html"
5++++
6+
17Write a gate to compute [Ackermann's Function](https://en.wikipedia.org/wiki/Ackermann_function)
28
39```
@@ -15,4 +21,4 @@ First, if `m` is zero, return the increment of `n`.
1521Second, if `n` is zero, decrement `m`, set `n` to 1 and recurse.
1622Else, decrement `m` and set `n` to be the value of the Ackermann function with `n` and the decrement of `n` as arguments.
1723
18−This is not a terribly useful function to compute but it has an interesting history in mathematics. When running this function the value grows rapidly even for very small input. The value of computing this where `m` is `4` and `n` is `2` is an integer with 19,729 digits.
24+This is not a terribly useful function to compute but it has an interesting history in mathematics. When running this function the value grows rapidly even for very small input. The value of computing this where `m` is `4` and `n` is `2` is an integer with 19,729 digits.