## Translation: from english to serbian

from serbian to english

# ackermann s function

• 1 ackermann's function

• akermanova funkcija

### Look at other dictionaries:

• Ackermann function — In recursion theory, the Ackermann function or Ackermann Péter function is a simple example of a general recursive function that is not primitive recursive. General recursive functions are also known as computable functions. The set of primitive… …   Wikipedia

• Ackermann-Funktion — Die Ackermannfunktion ist eine 1926 von Wilhelm Ackermann gefundene, extrem schnell wachsende mathematische Funktion, mit deren Hilfe in der theoretischen Informatik Grenzen von Computer und Berechnungsmodellen aufgezeigt werden können. Heute… …   Deutsch Wikipedia

• Ackermann ordinal — In mathematics, the Ackermann ordinal is a certain large countable ordinal, named after Wilhelm Ackermann. The term Ackermann ordinal is also occasionally used for the small Veblen ordinal, a somewhat larger ordinal. Unfortunately there is no… …   Wikipedia

• Ackermann — Acker comes from German or Old English, meaning field . It is related to the word acre , and therefore Ackermann means fieldman .This is a list of people called Ackermann:*Anton Ackermann (1905–1973), German foreign minister *Dorothea Ackermann… …   Wikipedia

• Fonction d'Ackermann — Dans la théorie de la récursivité, la fonction d Ackermann (aussi appelée fonction d Ackermann Péter), est un exemple simple de fonction récursive non récursive primitive, trouvée en 1926 par Wilhelm Ackermann. Elle est souvent présentée sous la… …   Wikipédia en Français

• Función de Ackermann — En teoría de la computación, la función de Ackermann es una función recursiva que toma dos números naturales como argumentos y devuelve un único número natural. Como norma general se define como sigue …   Wikipedia Español

• Primitive recursive function — The primitive recursive functions are defined using primitive recursion and composition as central operations and are a strict subset of the recursive functions (recursive functions are also known as computable functions). The term was coined by… …   Wikipedia

• Wilhelm Ackermann — Wilhelm Friedrich Ackermann (March 29, 1896, Herscheid municipality, Germany ndash; December 24, 1962 Lüdenscheid, Germany ) was a German mathematician best known for the Ackermann function, an important example in the theory of… …   Wikipedia

• Μ-recursive function — In mathematical logic and computer science, the μ recursive functions are a class of partial functions from natural numbers to natural numbers which are computable in an intuitive sense. In fact, in computability theory it is shown that the μ… …   Wikipedia

• Ordinal collapsing function — In mathematical logic and set theory, an ordinal collapsing function (or projection function) is a technique for defining (notations for) certain recursive large countable ordinals, whose principle is to give names to certain ordinals much larger …   Wikipedia

• μ-recursive function — In mathematical logic and computer science, the μ recursive functions are a class of partial functions from natural numbers to natural numbers which are computable in an intuitive sense. In fact, in computability theory it is shown that the μ… …   Wikipedia