In computer science, the Tak function is a recursive function, named after (竹内郁雄). It is defined as follows: def tak( x, y, z) if y < x tak( tak(x-1, y, z), tak(y-1, z, x), tak(z-1, x, y) ) else z endend This function is often used as a benchmark for languages with optimization for recursion.