使用阿克曼的功能? [英] Uses of Ackermann function?
问题描述
在我们的离散数学课我上大学时,老师展示了他的学生阿克曼函数并分配学生发展在纸上的功能。
In our discrete mathematics course in my university, the teacher shows his students the Ackermann function and assign the student to develop the function on paper.
除了作为一个基准递归优化,莫非是阿克曼函数具有任何实际用途?
Beside being a benchmark for recursion optimisation, does the Ackermann function has any real uses ?
推荐答案
是的。在(逆)阿克曼函数出现在算法复杂度分析。如果是这样,就意味着你几乎可以忽略这个词,因为它的增长非常缓慢(很像日志(日志......日志(N)...)),即LG *(N)。例如:最小生成树(也的here )和不相交集森林建设。
Yes. The (inverse) Ackermann function appears in complexity analysis of algorithms. When it does, it means you can almost ignore that term since it grows so slowly (a lot like log(log ... log(n)...)) i.e. lg*(n). For example: Minimum Spanning Trees (also here) and Disjoint Set forest construction.
这篇关于使用阿克曼的功能?的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!