The TAK function is a recursive function devised by I. Takeuchi in 1978 (Knuth 1998). For integers
,
, and
, it is defined by
 |
(1)
|
This can be described more simply by
 |
(2)
|
Let
count the executions of the "otherwise"
branch when the recursive definition is fully expanded, without reusing previously
computed values. Then
 |
(3)
|
The total number of function calls is
(Knuth 1991).
An auxiliary recurrence relation, related to the ballot problem, omits the last recursive
call:
 |
(4)
|
For integers
, it satisfies
(Knuth 1991).
The Takeuchi numbers are defined by
for integers
.
See also
Ackermann Function,
Ballot Problem,
Recursive Function,
Takeuchi
Number,
Takeuchi-Prellberg Constant
Explore with Wolfram|Alpha
References
Finch, S. R. Mathematical Constants. Cambridge, England: Cambridge University Press, p. 321, 2003.Gabriel,
R. P. Performance and Evaluation of LISP Systems. Cambridge, MA: MIT
Press, 1985.Knuth, D. E. "Textbook Examples of Recursion."
In Artificial
Intelligence and Mathematical Theory of Computation, Papers in Honor of John McCarthy
(Ed. V. Lifschitz). Boston, MA: Academic Press, pp. 207-229, 1991. https://arxiv.org/abs/cs/9301113.Knuth,
D. E. The
Art of Computer Programming, Vol. 2: Seminumerical Algorithms, 3rd ed.
Reading, MA: Addison-Wesley, 1998.Knuth, D. E. The
Art of Computer Programming, Vol. 3: Sorting and Searching, 2nd ed.
Reading, MA: Addison-Wesley, 1998.Vardi, I. "The Running Time of
TAK." Ch. 9 in Computational
Recreations in Mathematica. Redwood City, CA: Addison-Wesley, pp. 179-199,
1991.Referenced on Wolfram|Alpha
TAK Function
Cite this as:
Weisstein, Eric W. "TAK Function." From
MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/TAKFunction.html
Subject classifications