1. Tak (function)In computer science, the Tak function is a recursive function, named after Ikuo Takeuchi (竹内郁雄). It is defined as follows: def tak(x, y, z) if y < x tak(tak, tak, tak) else z end end This function is often used as a benchmark for languages with optimization for recursion.
Read “Tak (function)” on English Wikipedia
Read “竹内関数” on Japanese Wikipedia
Read “Tak (function)” on DBpedia
Read “Tak (function)” on English Wikipedia
Read “竹内関数” on Japanese Wikipedia
Read “Tak (function)” on DBpedia
Discussions
Log in to talk about this word.