计算机科学思想史,计算机科学思想史可计算性与计算复杂性（69页）-原创力文档...

Logo

计算机科学思想史

可计算性与计算复杂性

金小刚

AI Institute, College of Computer Science, Zhejiang University

E-mail: xiaogangj@

©2015 Xiaogang JIN. All rights reserved.

Great Ideas in Computer Science, Course/CS/Zhejiang Uinversity, Xiaogang Jin, March 10, 2015

Analysis of Algorithms Artificial Intelligence

Combinatorial Algorithms Compilers

Computational Complexity Computer

Architecture Computer Hardware Cryptography

Data Structures Databases Education Error Correcting

Codes Finite Automata Graphics Interactive

Computing Internet Communications List Processing

Numerical Analysis Numerical Methods Object Oriented

Programming Operating Systems Personal Computing

ProgramVerification Programming Programming

Languages Proof Construction Software Theory Software

EngineeringVerification of Hardware and Software Models

Computer Systems Machine Learning Parallel Computation

Great Ideas in Computer Science, Course/CS/Zhejiang Uinversity, Xiaogang Jin, March 10, 2015

Turing Award在可计算与计算复杂性领域

1976 Dana S. Scott, Michael Oser Rabin —— 非确定型自动机

1982 Stephen Arthur Cook —— NP完全性

1985 Richard Manning Karp

—— 证明一个问题是否是属于NP完全

1993 Juris Hartmanis, Richard Edwin Stearns

—— 计算复杂性

1995 Manuel Blum

—— 计算复杂性，密码系统和程序检查验证

2000 Andrew Chi-ChihYao (姚期智)

—— 伪随机数生成算法、加密算法和通讯复杂性

2010 Leslie G. Valiant —— 计算复杂性

Great Ideas in Computer Science, Course/CS/Zhejiang Uinversity, Xiaogang Jin, March 10, 2015

1976

Great Ideas in Computer Scie