International Journal of Soft Computing

113
Views

1
Downloads

An Efficient Algorithm for the Solution of Ackermann Function

Parviz Rashidian
Page: 9-12 | Received 21 Sep 2022, Published online: 21 Sep 2022

By Research Area

Medicine & Public Health Life Sciences Engineering Mathematics Biomedicine Physics Chemistry Computer Science Earth Sciences Social Sciences Business and Management Psychology Materials Science Economics Education Environment Philosophy Statistics Law Political Science and International Relations Pharmacy Dentistry Energy Linguistics Geography Finance Criminology and Criminal Justice Medicine Cultural and Media Studies History Architecture / Design Literature Biomedical Sciences Religious Studies Education & Language Food Science & Nutrition Public Health

By Volume and Issue

Abstract

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.

How to cite this article:

Parviz Rashidian . An Efficient Algorithm for the Solution of Ackermann Function.
DOI: https://doi.org/10.36478/ijscomp.2008.9.12
URL: https://www.makhillpublications.co/view-article/1816-9503/ijscomp.2008.9.12