|
理论计算机科学的重大思想
6.080 / 6.089 Great Ideas in Theoretical Computer Science |
|
| |
| 课程网址: |
http://ocw.mit.edu/courses/electrical-engineering-and-computer-sc...
|
| 主讲教师: |
Prof. Scott Aaronson
|
| 开课单位: |
麻省理工学院
|
| 开课时间: |
信息不详。欢迎您在右侧留言补充。
|
| 课程语种: |
英语
|
| 中文简介: |
本课程为理论计算机科学的一些中心思想提供了具有挑战性的介绍。它试图提出一个 "计算机科学的愿景超越计算机: 即 cs 作为一套数学工具, 用于理解复杂的系统, 如宇宙和心灵。从古代开始 — 欧几里得的算法和其他古老的计算思维例子 — 课程将通过命题逻辑、图灵机和可计算性、有限自动机、g ö del 定理迅速推进,高效的算法和可还原性, np 完整性, p 对 np 问题, 决策树和其他具体的计算模型, 随机性的力量, 密码学和单向函数, 学习的计算理论, 交互式校对,和量子计算和物理极限的计算。班级参与至关重要, 因为课堂将包括关于其中许多想法的含义的讨论和辩论。
|
| 课程简介: |
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.
|
| 关 键 词: |
计算机科学理论; 逻辑; 图灵机可计算性; 有限自动机; 哥德尔; 复杂性; 多项式时间; 高效的算法; 还原性; NP完全性; 私有密钥加密; 公钥加密
|
| 课程来源: |
麻省理工大学公开课
|
| 最后编审: |
2016-03-12：cmh
|
| 阅读次数: |
18
|
|
图 书 馆