https://github.com/donno2048/ackermann
The Ackermann function
https://github.com/donno2048/ackermann
ackermann algorithms functions recursion
Last synced: about 2 months ago
JSON representation
The Ackermann function
- Host: GitHub
- URL: https://github.com/donno2048/ackermann
- Owner: donno2048
- Created: 2021-01-10T14:12:35.000Z (over 5 years ago)
- Default Branch: main
- Last Pushed: 2021-03-08T16:11:34.000Z (over 5 years ago)
- Last Synced: 2025-01-06T16:50:46.435Z (over 1 year ago)
- Topics: ackermann, algorithms, functions, recursion
- Language: Jupyter Notebook
- Homepage:
- Size: 3.91 KB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Ackermann
The Ackermann function
A function suggested by Ackermann as an example for a recursive function cannot be written as an iterated function.
According to Professor David Brailsford this is one of the most difficult functions to evaluate if not the most (except the Busy Beaver).
It's estimated that in the time takes to calculate `ack(4, 4)` the whole time between the [big bang](https://en.wikipedia.org/wiki/Big_Bang) and the [big crunch](https://en.wikipedia.org/wiki/Big_Crunch) will pass, but for any pair of number the ack function will not go to an infinite loop.