Great Ideas in Theoretical Computer Science (Spring 2008)
10 votes
Free
|
||
|
This course provides a challenging introduction to some of the central ideas of theoretical computer science. It attempts to present a vision of "computer science beyond computers": that is, CS as a set of mathematical tools for understanding complex systems such as universes and minds. Beginning in antiquity—with Euclid's algorithm and other ancient examples of computational thinking—the course will progress rapidly through propositional logic, Turing machines and computability, finite automata, Gödel's theorems, efficient algorithms and reducibility, NP-completeness, the P versus NP problem, decision trees and other concrete computational models, the power of randomness, cryptography and one-way functions, computational theories of learning, interactive proofs, and quantum computing and the physical limits of computation. Class participation is essential, as the class will include discussion and debate about the implications of many of these ideas. Categories:
Computer Sciences
Starts :
2008-02-01 |
|
AlternativesIf you know any alternatives, please let us know. PrerequisitesIf you can suggest any prerequisite, please let us know. Certification Exams-- there are no exams to get certification after this course --If your company does certification for those who completed this course then register your company as certification vendor and add your exams to the Exams Directory. |
Let us know when you did the course Great Ideas in Theoretical Computer Science (Spring 2008).
Add the course Great Ideas in Theoretical Computer Science (Spring 2008) to My Personal Education Path.
Successfully added to your path.
View your pathSelect what exam to connect to the course. The course will be displayed on the exam page in the list of courses supported for certification with the exam.