图 书 馆
理论计算机科学的伟大思想Great Ideas in Theoretical Computer Science |
|
| 课程网址: | http://ocw.mit.edu/courses/electrical-engineering-and-computer-sc... |
| 主讲教师: | Scott Aaronson |
| 开课单位: | 麻省理工学院 |
| 开课时间: | 2008-01-01 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | 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. |
| 关 键 词: | 挑战性; 中心思想; 计算机 |
| 课程来源: | 麻省理工学院公开课 |
| 最后编审: | 2020-11-27：yumf |
| 阅读次数: | 95 |