Function of Sudan

In Calculabilité, the Fonction of Sudan is an example of function recursive Récursive but not primitive. This is also the case of much more known the Fonction of Ackermann.

It was conceived in 1927 by the Rumanian mathematician Gabriel Sudan raises David Hilbert.

Definition

$F\; \_0\; (X,\; there)\; =\; x+y,\; \backslash ,$

$F\; \_\; \{n+1\}\; (X,\; 0)\; =\; X,\; \backslash \; N\; \backslash \; Ge\; 0\; \backslash ,$

$F\; \_\; \{n+1\}\; (X,\; y+1)\; =\; F\; \_n\; (F\_\; \{n+1\}\; (X,\; there),\; F\_\; \{n+1\}\; (X,\; there)\; +\; there\; +\; 1),\; \backslash \; N\; \backslash \; Ge\; 0.\; \backslash ,$

See too

• recursive Algorithm
• recursive Functions
• Function of Ackermann

Random links:

Back office (software) | Hygrophila | Equip with Poland of Rugby to XV | Glacial raw wool | Morvac' H | SOLIDES_SOLUBLES_TOTAUX_Kanowna

© 2007-2008 speedlook.com; article text available under the terms of GFDL, from fr.wikipedia.org