PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: Very high Entry average rating: Very high
Takeuchi function (Definition)

The Takeuchi function is a triply recursive 3-parameter function originally defined by Ichiro Takeuchi in 1978 as $ t(x, y, z) = y$ if $ x \leq y$ and $ t(x, y, z) = t(t(x - 1, y, z), t(y - 1, z, x), t(z - 1, x, y))$ otherwise. Later John McCarthy simplified the definition of the function as $ t(x, y, z) = y$ if $ x \leq y$, $ t(x, y, z) = z$ if $ y \leq z$ and $ t(x, y, z) = x$ in all other cases.

For example, $ t(194, 13, 5) = 194$ since 194 is not less than 13, and 13 is not less than 5. The return value of the function “is on no practical significance,” but the function itself “is useful for benchmark testing of programming languages.” (Finch, 2003) The function $ T(x, y, z)$ is the number of times $ t$ calls itself to obtain the return value. A properly optimized implementation of the function in a given programming language should not require more recursion than $ T$ indicates.

Bibliography

1
Steven R. Finch Mathematical Constants New York: Cambridge University Press (2003): 321



"Takeuchi function" is owned by PrimeFan.
(view preamble)

View style:


Attachments:
Takeuchi number (Definition) by PrimeFan
Log in to rate this entry.
(view current ratings)

Cross-references: language, function, recursive
There is 1 reference to this entry.

This is version 1 of Takeuchi function, born on 2007-09-21.
Object id is 9957, canonical name is TakeuchiFunction.
Accessed 274 times total.

Classification:
AMS MSC05A16 (Combinatorics :: Enumerative combinatorics :: Asymptotic enumeration)

Pending Errata and Addenda
None.
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)