-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathackermann.ts
70 lines (62 loc) · 1.95 KB
/
ackermann.ts
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
import { add, sub } from "./stringMath.ts";
export function ackermann_bigint(n: bigint, m: bigint, logging?: boolean): bigint {
const arr = [n, m];
while (arr.length > 1) {
if (logging)
console.log(bigintArrToString(arr));
arr.push(...a_bigint(...(arr.splice(arr.length - 2, 2) as [bigint, bigint])));
}
return arr[0];
}
function bigintArrToString(arr: bigint[]): string {
let str = "";
for (let i = 0; i < arr.length; i++) {
if (i < arr.length - 1) {
str += `a(${arr[i]}, `
continue;
}
str += arr[i];
}
return str.padEnd(str.length + (arr.length - 1), ")");
}
function a_bigint(n: bigint, m: bigint): bigint[] {
if (n === 0n)
return [m + 1n];
if (m === 0n)
return [n - 1n, 1n];
return [n - 1n, n, m - 1n];
}
export function ackermann_string(n: number, m: number, logging?: boolean): string {
let str = toAString(n, m);
while (str.includes("a")) {
if (logging) console.log(str);
let innerA = str.substring(str.lastIndexOf("a"));
innerA = innerA.substring(0, innerA.indexOf(")") + 1);
str = str.substring(0, str.lastIndexOf("a")) + a_string(innerA) + str.substring(str.lastIndexOf("a") + innerA.length);
// break;
}
return str;
}
function toAString(n: string | number, m: string | number): string {
return `a(${n}, ${m})`;
}
function a_string(str: string): string {
const n = str.substring(2, str.indexOf(",")).trim();
const m = str.substring(str.indexOf(",") + 1, str.length - 1).trim();
// console.log({ n, m });
if (n === "0")
return add(m, "1");
if (m === "0")
return toAString(sub(n, "1"), "1");
// console.log(m, "-", 1);
// console.log(sub(m, "1"));
return toAString(sub(n, "1"), toAString(n, sub(m, "1")));
}
export function ackermann_simple(n: number, m: number): number {
if (n === 0)
return m + 1;
if (m === 0)
return ackermann_simple(n - 1, 1);
return ackermann_simple(n - 1, ackermann_simple(n, m - 1));
}
export default ackermann_bigint;