Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02287637n
Noun Concept
SYL
No term available
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
Relations
Sources
IS A
EN
function
NAMED AFTER
Wilhelm ackermann

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