Loading video...
Video Failed to Load
No algorithm can decide whether an arbitrary program will halt. This is why every runtime ships with timeouts. Alan Turing proved this before anyone had a computer to run it on. MIT 6.006 Introduction to Algorithms, Fall 2011 Instructor: Erik Demaine
77,446 views • 24 days ago •via X (Twitter)
0 Comments
No comments available
Comments from the original post will appear here
Related Videos
An MIT introduction to computer science & Python programming:
MIT CSAIL
182,390 views • 1 year ago

