Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02287637n
Noun Concept
Categories: long volume value, Theory of computation, Large integers, Computability theory, Special functions
EN
Ackermann function  Ackermann's function  Ackermann Number  Ackerman's function  Ackerman function
EN
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. Wikipedia
Definitions
Relations
Sources
EN
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. Wikipedia
Total non-primitive-recursive computable function of three arguments Wikidata
A function of two parameters whose value grows very fast. OmegaWiki
One of the simplest and earliest examples of a total computable function that is not primitive recursive. Wiktionary
A total computable function that is not primitive recursive. Wiktionary (translation)
IS A
function
NAMED AFTER
Wilhelm Ackermann
Wikipedia
EN
Ackermann function
Wikidata
EN
Ackermann function
Wiktionary
EN
Ackermann function
OmegaWiki
EN
Ackermann's function
Wikipedia Redirections
EN
Ackerman's function, Ackerman function, Ackermann's function, Ackermann-Peter function, Ackermann algorithm, Ackermann Function, Ackermann number, Ackermann Number, Ackermann numbers, Akerman function, Akermann function, Inverse Ackerman's function, inverse Ackermann, inverse Ackermann function, Péter function

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License