You are on page 1of 1

Acker (m, n)

If m == 0: return n+1;

Else if n == 0: return Acker(m-1,1)

Else return Acker (m-1, Acker (m, n-1))

Input: m, n

T(m,n) = T(m-1,T(m,n-1)) = T(m-2,T(m-1,T(m,n-1)-1)) = T(m-3,T(m-2, T(m-1,T(m,n-1)-1)-1))

= T(m-x,T(m-x+1,…T(m,n-1)-1)-1)…)

T(m,n) = 1 khi m = 0  m – x = 0  m = x

T(m,n) = T(m-1,1) khi n =0.

= T(m-2,T(m-1,0)) =

You might also like