The Most Difficult Program to Compute? – Computerphile

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:

Products You May Like

Articles You May Like

A brief history of plural word…s – John McWhorter
The Race to a Habitable Exoplanet – Time Warp Challenge | Space Time
The Baker Test
A tricky puzzle!!!
Corporate Lab Rats with Dan Lyons

Leave a Reply

Your email address will not be published. Required fields are marked *