Skip to main content
Dictionary
Store
Blog
World
Help
Advertise
Chat
System Status
Information Collection Notice
Trademark Concerns
reCAPTCHA Privacy
Terms of Service
reCAPTCHA Terms
Privacy Policy
Accessibility
Report a Bug
Data Request
Contact Us
Security
DMCA
© 1999–2026 Urban Dictionary ®
Mugs
Tees
Hoodies
Pro Customization
Create unique products with your own words and definitions
Preview
Personalize Your Design
Your Word
Your Definition
In the computational sciences, the Ackermann function (represented as A(m,n) is the simplest example of a total function (a function defined for all possible input values) which is computable but not primitive recursive, which was originally formulated to disprove the once-common belief that every computable function was also primitive recursive, but is now used to generate absurdly large numbers to horrify mathematicians.
Text fits
Save
Cancel