Skip to content
0:00 / 0:00

#ackermannfunction#recursion#computability

The Most Difficult Program to Compute? - Computerphile

Computerphile

2.6M subscribers • 66 videos on Hallway

YouTube
  • Recommended by 2 people: 2 in engineering communities.
  • Presented by David Brailsford, Professor of Computer Science

Intermediate. Assumes working knowledge.

1.4M views12 years ago2 recommendations

Computer scienceAlgorithmsComputation and complexity

David Brailsford explains the Ackermann function, its rapid growth, and its significance in the study of recursion and computability.

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: youtube.com/watch?v=uNACwX-O5lk What on Earth is Recursion?: youtu.be/Mv9NEXX1VHc Fibonacci Programming: youtu.be/7t_pTlH9HwA Heartbleed, Running the Code: youtu.be/1dOCHwf8zVQ VR Series: COMING SOON! Please note, Ackermann is spelled incorrectly with one "n" on the title plate - Apologies facebook.com/computerphile twitter.com/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

Why it's here

2 people recommend this, 2 dispute it

What people say. Often cited in discussions about recursion versus iteration, though some users note it contains minor inaccuracies regarding iterative implementation.

u/Zheromin r/compsci • Recommends

On “If all recursive functions can be written iterative, then what's up with the Ackermann function?”

Posted this as a reply to whoever called me wrong on my massively downvoted comment, but I wanna make sure OP sees it. The source of my explanation: link to this video

u/NoTroopin r/compsci • Recommends

On “Recursion vs. Iteration”

>whatever recursion can do, iteration does too This isn't actually necessarily true. One example that the recursion cannot be "unraveled" is Ackermann's function. That said, if it is possible, iterative solutions are generally faster as they don't have to worry about the overhead of the call stack.

u/Zheromin r/compsci • Recommends

On “If all recursive functions can be written iterative, then what's up with the Ackermann function?”

link to this video Check it out, buddy.

u/warm_sockin r/compsci • Disputes

On “If all recursive functions can be written iterative, then what's up with the Ackermann function?”

Thank you, this makes perfect sense. The source of my confusion was this video, which states Ackermann can't be implemented iteratively, so I take it this video is wrong? (In fact I was even able to find an iterative solution online, so I don't understand where they're coming from in the beginning of this video.)

u/vicelioin r/compsci • Disputes

On “Can the Ackermann function be rewritten so that it is an iterative function?”

So is this youtube video incorrect? link to this video (watch first minute)

u/warm_sockin r/compsci • Disputes

On “If all recursive functions can be written iterative, then what's up with the Ackermann function?”

This video says that Ackermann can't be implemented with iteration. Is it wrong?

u/warm_sockin r/compsci • Disputes

On “If all recursive functions can be written iterative, then what's up with the Ackermann function?”

The beginning of this video says Ackermann cannot be done iteratively, which is where my confusion originated. Is that wrong?

u/the123king-redditin r/compsci • Mentions

On “Was doing some research on the Turing machine and wanted to see someone’s thoughts on a brainstorming session I just had for catching infinite loops. Feel free to be hyper critical I am simply trying to learn.”

You can never predict if a program will finish. Computerphile did a video on it. I think its this one link to this video