- Author
- Tim Roughgarden, as instructor, on Ergo
- Published
- Undated
- Kind
- Course landing page for a video lecture series
- Original
- ergo.org/courses/computation-as-a-universal-and-fundamental-concept
- Subject
- Formal methods and proof
What it is
Ergo, a nonprofit video site, published this page. It describes a course taught by Tim Roughgarden. The page says no background in computer science or mathematics is required.
What it says
- The course starts from Turing's 1936 work, showing some problems no algorithm solves.
- It then asks which problems can be solved quickly, citing Dijkstra and Karatsuba.
- The page says the Traveling Salesman Problem led to the theory of NP-completeness.
- It says the course traces P versus NP through Hilbert, Godel and von Neumann.
What evidence it gives
The page offers a prose summary only. It gives no transcript text, exercises or results.
Interests and limits
The page is a promotional description written by the host site. The course page text was read, but the videos and transcripts were not. It says nothing on how well the course works. The summary of the lectures is the site's wording, not the lecturer's.