mathematics

Tak (function)

Tak (function) is a mathematics topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Tak (function) rather than just read about it. In short: In computer science, the Tak function is a recursive function, named after Ikuo Takeuchi. It is defined as follows: τ ( x , y , z ) = { τ ( τ ( x − 1 , y , z ) , τ ( y − 1 , z , x ) , τ ( z − 1 , x , y ) ) if y < x z otherwise {\displaystyle \tau (x,y,z)={\begin{cases}\tau (\tau (x-1,y,z),\tau (y-1,z,x),\tau (z-1,x,y))&{\text{if }}y<x\\z&{\text{otherwise}}\end{cases}}} This function is often used as a benchmark for…

Key takeaways

Tak (function) belongs to mathematics; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Tak (function) to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Tak (function) from memory before moving on to harder problems.

Reference excerpt

In computer science, the Tak function is a recursive function, named after Ikuo Takeuchi. It is defined as follows:

τ ( x , y , z ) = { τ ( τ ( x − 1 , y , z ) , τ ( y − 1 , z , x ) , τ ( z − 1 , x , y ) ) if y < x z otherwise {\displaystyle \tau (x,y,z)={\begin{cases}\tau (\tau (x-1,y,z),\tau (y-1,z,x),\tau (z-1,x,y))&{\text{if }}y<x\\z&{\text{otherwise}}\end{cases}}}

This function is often used as a benchmark for languages with optimization for recursion.

tak() vs. tarai()

The original definition by Takeuchi was as follows:

tarai is short for たらい回し (tarai mawashi, "to pass around") in Japanese. John McCarthy named this function tak() after Takeuchi. However, in certain later references, the y somehow got turned into the z. This is a small, but significant difference because the original version benefits significantly from lazy evaluation. Though written in exactly the same manner as others, the Haskell code below runs much faster.

One can easily accelerate this function via memoization yet lazy evaluation still wins. The best known way to optimize tarai is to use a mutually recursive helper function as follows.

Here is an efficient implementation of tarai() in C:

Note the additional check for (x <= y) before z (the third argument) is evaluated, avoiding unnecessary recursive evaluation.

References

External links Weisstein, Eric W. "TAK Function". MathWorld. TAK Function Archived 2007-09-12 at the Wayback Machine

Worked examples

Example 1 — a first encounter with Tak (function)

Start with the simplest possible case. Write down what Tak (function) claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In mathematics, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Tak (function) before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Tak (function) ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Tak (function)

In research: Tak (function) appears in mathematics research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Tak (function) in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Tak (function) is common in secondary-school and first-year university syllabi. It links to neighbouring topics Functions and mappings, Special functions, so understanding it makes those chapters shorter.
In everyday life: Look for Tak (function) outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “Tak (function)” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Tak (function) in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Tak (function) means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Tak (function) out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Tak (function) in simple terms?

In computer science, the Tak function is a recursive function, named after Ikuo Takeuchi. It is defined as follows: τ ( x , y , z ) = { τ ( τ ( x − 1 , y , z ) , τ ( y − 1 , z , x ) , τ ( z − 1 , x , y ) ) if y < x z otherwise {\displaystyle \tau (x,y,z)={\begin{cases}\tau (\tau (x-1,y,z),\tau (y-1…

Why does Tak (function) matter?

Because it connects several mathematics ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Tak (function)?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Tak (function).