new tasks

Task/Ackermann_function/Python/ackermann_function-2.py

@@ -0,0 +1,7 @@
+def ack2(M, N):
+    if M == 0:
+        return N + 1
+    elif N == 0:
+        return ack1(M - 1, 1)
+    else:
+        return ack1(M - 1, ack1(M, N - 1))

Task/Ackermann_function/Python/ackermann_function-3.py

@@ -0,0 +1,10 @@
+>>> import sys
+>>> sys.setrecursionlimit(3000)
+>>> ack1(0,0)
+1
+>>> ack1(3,4)
+125
+>>> ack2(0,0)
+1
+>>> ack2(3,4)
+125

Task/Ackermann_function/Python/ackermann_function-4.py

@@ -0,0 +1,6 @@
+def ack2(M, N):
+   return (N + 1)   if M == 0 else (
+          (N + 2)   if M == 1 else (
+          (2*N + 3) if M == 2 else (
+          (8*(2**N - 1) + 5) if M == 3 else (
+          ack2(M-1, 1) if N == 0 else ack2(M-1, ack2(M, N-1))))))

Task/Ackermann_function/Python/ackermann_function.py

@@ -0,0 +1,3 @@
+def ack1(M, N):
+   return (N + 1) if M == 0 else (
+      ack1(M-1, 1) if N == 0 else ack1(M-1, ack1(M, N-1)))