During our Quantum Algorithm lecture, we’ll take a quick look at what some researchers are doing to solve an NP-complete problem called the Traveling Salesperson problem. The video we will look at will be the start and end (2:42 and 47:50) of William Cook’s lecture here.
Also, find an intro to the math behind Quantum Computing here.
A few of you have asked about the name of the movie whose clip I showed you in our session on cryptography – it is called “The Imitation Game” starring Benedict Cumberbatch as Alan Turing, see here for more info.
As I mentioned in class, Alan Turing was a giant, widely considered to be the father of theoretical computer science and artificial intelligence – he gave the Church-Turing Thesis, imagined the Turing machine (the basis for all classical computing machines) and was a powerful force in the battle of the minds against the Axis powers during WW II. Read more about him here.
Thanks for making our pie challenge a success!! Interested in the solution? Find it here.
As announced in class today, the due date for Assignment #4 has been extended to 8 am tomorrow, 11/28.