Ackermann function
total non-primitive-recursive computable function
Facts
5 properties- Instance of
- function, mathematical concept, binary function
- Defining formula
- A(m, n) = \begin{cases}n+1 & m = 0 \\A(m-1, 1) & m > 0, n = 0 \\A(m-1, A(m, n-1)) & m > 0, n > 0.\end{cases}
- In defining formula
- m, n
- Named after
- Wilhelm Ackermann
- Studied by
- computability theory
🏷️ Also known as
en Ackermann function
ar دالة أكرمان
ar اقتران أكرمان
cs Ackermannova funkce
cs Ackermanova funkce
de Ackermannfunktion
de Ackermann-Funktion
es función de Ackermann
fa تابع اکرمن
fi Ackermannin funktio
fr fonction d'Ackermann
he הפונקציה של אקרמן
he פונקציית אקרמן
he פונקצית אקרמן
hu Ackermann-függvény
it funzione di Ackermann
ja アッカーマン函数
ja アッカーマン関数
ko 애커만 함수
nl Ackermann functie
🔖 Identifiers · 9
- OpenAlex ID
- C33436860
- Dictionary of Algorithms and Data Structures ID
- ackermann, AckermansFunction
- Encyclopedia of Mathematics article ID
- Ackermann_function
- Freebase ID
- /m/0125s
- MathWorld ID
- AckermannFunction
- Metamath statement ID
- df-ack
- Microsoft Academic ID (discontinued)
- 33436860
- Rosetta Code page ID
- Ackermann_function
- Treccani's Enciclopedia della Matematica ID
- funzione-di-ackermann
🔗 Connections
Instance of 2
Created notable works 1
Maintained by WikiProject 1
Named after 1
Studied by 1
Press Enter · cited answer in seconds
0 sources
Summary
Ackermann function is a function[1].
Key Facts
- Instance of: mathematical concept[2], binary function[3]
- Named after: Wilhelm Ackermann[4]
- Defining formula: A(m, n) = \begin{cases}n+1 & m = 0 \A(m-1, 1) & m > 0, n = 0 \A(m-1, A(m, n-1)) & m > 0, n > 0.\end{cases}[5]
- Studied by: computability theory[6]
- Maintained by WikiProject: WikiProject Mathematics[7]
- In defining formula: m[8], n[9]