TY  - JOUR
T1  - An Efficient Algorithm for the Solution of Ackermann Function
AU - , Parviz Rashidian 
JO  - International Journal of Soft Computing
VL  - 3
IS  - 1
SP  - 9
EP  - 12
PY  - 2008
DA  - 2001/08/19
SN  - 1816-9503
DO  - ijscomp.2008.9.12
UR  - https://makhillpublications.co/view-article.php?doi=ijscomp.2008.9.12
KW  - Recursive function
KW  -execution time
KW  -procedure
KW  -memory
KW  -Ackermann function
AB  - One of the main problems for running recursive functions with high rate of growth is execution time and memory spaces, in which case we can not run the program. In addition many commonly used programming languages do not allow recursive programs. This study presents an efficient algorithm for Ackermann recursive function. The algorithm is tested by comparing with recursive function in high level language such as Pascal.
ER  -