Difference between revisions of "Manuals/calci/ACKERMANN"
Jump to navigation
Jump to search
(Created page with "<div style="font-size:30px">'''BETADIST(x,alpha,beta,a,b)'''</div><br/> *<math>x</math> is the value between <math>a</math> and <math>b</math> *alpha and beta are the value of...") |
|||
(7 intermediate revisions by 2 users not shown) | |||
Line 1: | Line 1: | ||
− | <div style="font-size:30px">''' | + | <div style="font-size:30px">'''ACKERMANN(m,n)'''</div><br/> |
− | *<math> | + | *<math>m</math> and <math>n</math> are the positive integers. |
− | |||
− | |||
==Description== | ==Description== | ||
+ | *The Ackermann function is a classic example of a recursive function, notable especially because it is not a primitive recursive function. | ||
+ | *All primitive recursive functions are total and computable, but the Ackermann function illustrates that not all total computable functions are primitive recursive. | ||
+ | *Its arguments are never negative and it always terminates. | ||
+ | *The two-argument Ackermann–Péter function, is defined as follows: | ||
+ | |||
+ | <math>A(m,n) = \begin{cases} n+1 \mbox {if} m=0 \\ | ||
+ | A(m-1,1) & \mbox {if} m>0 and n=0 \\ | ||
+ | A(m-1,A(m,n-1))& \mbox {if} m>0 and n>0 | ||
+ | \end{cases} </math>\\ | ||
+ | for nonnegative integers m and n. | ||
+ | *Its value grows rapidly, even for small inputs. | ||
+ | |||
+ | ==Example== | ||
+ | |||
+ | ==Related Videos== | ||
+ | |||
+ | {{#ev:youtube|v=CUbDmWIFYzo|280|center|Ackermann}} | ||
+ | |||
+ | ==See Also== | ||
+ | *[[Z_API_Functions | List of Main Z Functions]] | ||
+ | |||
+ | *[[ Z3 | Z3 home ]] | ||
+ | |||
+ | |||
+ | ==References== | ||
+ | |||
+ | [https://en.wikipedia.org/wiki/Ackermann_function Ackermann Function] | ||
+ | |||
+ | |||
+ | *[[Z_API_Functions | List of Main Z Functions]] | ||
+ | *[[ Z3 | Z3 home ]] |
Latest revision as of 19:10, 14 February 2019
ACKERMANN(m,n)
- and are the positive integers.
Description
- The Ackermann function is a classic example of a recursive function, notable especially because it is not a primitive recursive function.
- All primitive recursive functions are total and computable, but the Ackermann function illustrates that not all total computable functions are primitive recursive.
- Its arguments are never negative and it always terminates.
- The two-argument Ackermann–Péter function, is defined as follows:
\\
for nonnegative integers m and n.
- Its value grows rapidly, even for small inputs.
Example
Related Videos
See Also
References