new files

Task/Ackermann-function/Haskell/ackermann-function-1.hs

@@ -0,0 +1,3 @@
+ack 0 n = n + 1
+ack m 0 = ack (m-1) 1
+ack m n = ack (m-1) (ack m (n-1))

Task/Ackermann-function/Haskell/ackermann-function-2.hs

@@ -0,0 +1,9 @@
+-- everything here are [Int] or [[Int]], which would overflow
+-- * had it not overrun the stack first *
+ackermann = iterate ack [1..] where
+	ack a = s where
+		s = a!!1 : f (tail a) (zipWith (-) s (1:s))
+	f a (b:bs) = (head aa) : f aa bs where
+		aa = drop b a
+
+main = mapM_ print $ map (\n -> take (6 - n) $ ackermann !! n) [0..5]