The story of recursion continues as Professor Brailsford explains one of the most difficult programs to compute: Ackermann's function.
Professor Brailsford's programs: bit.ly/1nhKtW4
Follow Up Film from the Prof in response to this film: brvid.net/video/video-uNACwX-O5lk.html
What on Earth is Recursion?: brvid.net/video/video-Mv9NEXX1VHc.html
Fibonacci Programming: brvid.net/video/video-7t_pTlH9HwA.html
Heartbleed, Running the Code: brvid.net/video/video-1dOCHwf8zVQ.html
VR Series: COMING SOON!
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: bit.ly/nottscomputer
Computerphile is a sister project to Brady Haran's Numberphile. See the full list of Brady's video projects at: bit.ly/bradychannels
1 Jul 2014