Defined on all possible inputs.
page 1 of 1
Example
The Ackermann function is one of the simplest and earliest examples of a total computable function that is not primitive recursive.
Order number
5
Part of speech
adjective
Comments are not enabled for this type of record.
Log in to see the translation.
Log in to see your statistics.