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: http://bit.ly/1nhKtW4

Follow Up Film from the Prof in response to this film: https://www.youtube.com/watch?v=uNACwX-O5lk

What on Earth is Recursion?: http://youtu.be/Mv9NEXX1VHc
Fibonacci Programming: http://youtu.be/7t_pTlH9HwA
Heartbleed, Running the Code: http://youtu.be/1dOCHwf8zVQ
VR Series: COMING SOON!

Please note, Ackermann is spelled incorrectly with one “n” on the title plate – Apologies

http://www.facebook.com/computerphile
Tweets by computer_phile

This video was filmed and edited by Sean Riley.

Computer Science at the University of Nottingham: http://bit.ly/nottscomputer

Computerphile is a sister project to Brady Haran’s Numberphile. See the full list of Brady’s video projects at: http://bit.ly/bradychannels