Definitions from Wiktionary (Ackermann function)
▸ noun: (computing theory) One of the simplest and earliest examples of a total computable function that is not primitive recursive.
▸ Words similar to ackermann function
▸ Usage examples for ackermann function
▸ Idioms related to ackermann function
▸ Wikipedia articles (New!)
▸ Words that often appear near ackermann function
▸ Rhymes of ackermann function
▸ Invented words related to ackermann function
▸ noun: (computing theory) One of the simplest and earliest examples of a total computable function that is not primitive recursive.
Similar:
computable function,
recursive function,
computable analysis,
arithmetic function,
Kleene's recursion theorem,
accumulator,
Freiman's theorem,
anticommutator,
clarithmetic,
primitive recursion,
more...
Opposite:
▸ Words similar to ackermann function
▸ Usage examples for ackermann function
▸ Idioms related to ackermann function
▸ Wikipedia articles (New!)
▸ Words that often appear near ackermann function
▸ Rhymes of ackermann function
▸ Invented words related to ackermann function