图 书 馆
首页 → 计算机科学技术
6.045 J 自动机、可计算性与复杂性6.045J Automata, Computability, and Complexity |
|
| 课程网址: | http://ocw.mit.edu/courses/electrical-engineering-and-computer-sc... |
| 主讲教师: | Nancy Lynch |
| 开课单位: | 麻省理工学院 |
| 开课时间: | 信息不详。欢迎您在右侧留言补充。 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | This course is offered to undergraduates and introduces basic mathematical models of computation and the finite representation of infinite objects. The course is slower paced than 6.840J/18.404J. Topics covered include: finite automata and regular languages, context-free languages, Turing machines, partial recursive functions, Church's Thesis, undecidability, reducibility and completeness, time complexity and NP-completeness, probabilistic computation, and interactive proof systems. |
| 关 键 词: | 有限自动机; 图灵机; 停机问题; 可计算性; 计算复杂性; 多项式时间; 概率算法; 私钥密码; 公钥密码; 随机性 |
| 课程来源: | 麻省理工学院公开课 |
| 最后编审: | 2018-06-08：cmh |
| 阅读次数: | 47 |