Ackermann Function
The Ackermann function, named after Wilhelm Ackermann, is a mathematical function that is total and computable but not primitive recursive, demonstrating a key distinction in computability theory. It grows very rapidly and has been adapted into various forms, including a well-known two-argument version by Rózsa Péter and Raphael Robinson. The function extends basic arithmetic operations and plays a foundational role in the study of recursive functions and computation.
Opening excerpt (first ~120 words) tap to expand
Toggle the table of contents Ackermann function 27 languages العربيةCatalàČeštinaDeutschEsperantoEspañolفارسیSuomiFrançaisGalegoעבריתMagyarItaliano日本語한국어LombardNederlandsPolskiPiemontèisPortuguêsРусскийСрпски / srpskiSvenskaTürkçeУкраїнськаTiếng Việt中文 Edit links ArticleTalk English ReadEditView history Tools Tools move to sidebar hide Actions ReadEditView history General What links hereRelated changesUpload filePermanent linkPage informationCite this pageGet shortened URL Print/export Download as PDFPrintable version In other projects WikifunctionsWikidata item Appearance move to sidebar hide From Wikipedia, the free encyclopedia Quickly growing function .mw-parser-output .hatnote{font-style:italic}.mw-parser-output div.hatnote{padding-left:1.6em;margin-bottom:0.5em}.mw-parser-output…
Excerpt limited to ~120 words for fair-use compliance. The full article is at Wikipedia.
