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

Neutron Star Merger Gravitational Waves and Gamma Rays
41 Undomestic, Domesticated Animals – mental_floss on YouTube (Ep.8)
Why cities are full of uncomfortable benches
Could You Rip Out A Spine?
How To Know If It’s Aliens

Leave a Reply

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