Рет қаралды 1,399,937
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: • Ackermann Follow Up - ...
What on Earth is Recursion?: • What on Earth is Recur...
Fibonacci Programming: • Fibonacci Programming ...
Heartbleed, Running the Code: • Heartbleed, Running th...
VR Series: COMING SOON!
Please note, Ackermann is spelled incorrectly with one "n" on the title plate - Apologies
/ computerphile
/ computer_phile
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