Tuesday, July 26, 2016

The Most Difficult Program to Compute? Meet the Ackermann function

The Most Difficult Program to Compute?
Meet the Ackermann function. Fascinating subject :)

A(x,y)={y+1 if x=0; A(x-1,1) if y=0; A(x-1,A(x,y-1)) otherwise.

 by Computerphile 


 

Posted by at
Labels: , , ,

No comments:

Post a Comment

Your comment will be visible after approval.

Subscribe to: Post Comments (Atom)