The Most Difficult Program to Compute? - Computerphile

by Super User, 5 years ago
0 0
The story of recursion continues as Professor Brailsford explains one of the most difficult programs to compute: Ackermann's function.

Professor Brailsford's programs:

Follow Up Film from the Prof in response to this film:

What on Earth is Recursion?:
Fibonacci Programming:
Heartbleed, Running the Code:

Please note, Ackermann is spelled incorrectly with one "n" on the title plate - Apologies

This video was filmed and edited by Sean Riley.

Computer Science at the University of Nottingham:

Computerphile is a sister project to Brady Haran's Numberphile. See the full list of Brady's video projects at: