Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the Halting Problem, exploring whether every problem can be solved by an algorithm, using a diagonalization argument to determine if a computer program halts for a given input. It also delves into efficiently determining the position of the smallest element in a list and the cashier's algorithm for returning the least number of coins for a given amount.