Calculate the the value of ackermann(n, m) for arbitrarily large integers

You can use this script directly via Deno. To do that, first install Deno by following the instructions listed at deno.land.

You can now enter the following command in your terminal to automatically install Ackermann-Pro and add it to your PATH:

deno install -n ackermann https://raw.githubusercontent.com/JustAnotherJavaProgrammer/Ackermann-Pro/master/console.ts

The Ackermann-Pro command line can be used in this way:

ackermann [n] [m] OPTIONS

Valid options are:

• --logging, -l: enable logging of intermediate steps

stringMath.ts contains code to perform simple arithmetic operations (currently only addition and subtraction) and some checks on integers represented as Base-10 strings. This might be helpful if you are working with numbers that are too large for even BigInts. This is to be seen as a proof of concept.

Note: The functions contained in stringMath.ts aren't well-optimized and computationally expensive. Avoid using them if BigInt fits your needs (it should; learn more about BigInts at MDN).

1. A recursive, Number-based one: This version is a very simple implementation, which will quickly reach its limits by reaching the recursion limit of the JavaScript runtime.
2. A non-recursive, computationally expensive, String-based one: This implementation treats numbers as Strings, which allows for larger numbers and eliminates the need for recursion by also representing the current state of the computation as a String.
3. A non-recursive, less computationally expensive, BigInt-Array-based on (used in the command line & exported by default): This implementation represents the current state of the computation as an Array of BigInts, which results in the largest representable number values and less RAM-usage.

benchmark.ts contains a benchmark tool with similar command line usage to the CLI. You should add the --allow-hrtime command line option when you run it, e. g.:

deno run --allow-hrtime .\benchmark.ts 3 7

The usage is similar to the command line tool:

benchmark [n] [m] OPTIONS

Valid options are:

• --logging, -l enable logging of intermediate steps
• --skip-recursion, -s skip the recursion method The -s-option can be used to circumvent stack overflow errors, which occur at higher values for n and m.

The output of benchmark.ts will look something like this:

> deno run --allow-hrtime .\benchmark.ts 3 7
Now benchmarking Ackermann-Pro - developed by JustAnotherJavaProgrammer
Calculating the value of a(3, 7) using the three different methods...
Using recursion...
Using Strings...
Using BigInts...
The results are in!
a(3, 7) = 1021
Time spent (ms)         Method
10.037199999999999      Recursion
166.6023                BigInts
2480.9639               Strings

You can clearly see that, even though the recursive approach remains the fastest method, the usage of BigInts results in a faster runtime than the usage of Strings without risking stack overflows like the recursion-method.