图灵,教会,哥德尔,可计算性,复杂性和随机性:我见Turing, Church, Gödel, Computability, Complexity and Randomization: A Personal View |
|
课程网址: | http://videolectures.net/turing100_rabin_turing_church_goedel/ |
主讲教师: | Michael O. Rabin |
开课单位: | 哈佛大学 |
开课时间: | 2012-07-10 |
课程语种: | 英语 |
中文简介: | 上面提到的在九十年代中期创新了可计算性的概念。AlanTuring通过创建一个通用存储程序计算机模型给出了可计算性的定义。随后,通过讨论可计算函数的固有复杂性,对可计算函数和非可计算函数之间的区别进行了改进。演讲者将从他与Church、Gö;del以及与John von Neumann合作的人们的个人互动中,描绘出计算机的发展历程,并展望计算机科学和技术的未来。 |
课程简介: | The above named have innovated the concept of computability in the mid ninety-thirties. Alan Turing gave his definition of computability via a creation of a model of a universal stored program computer. The distinction between computable and non-computable functions was subsequently refined by a discussion of the inherent complexity of computable functions. The speaker will draw from his personal interaction with Church, Gödel and the people working with John von-Neumann a picture of the evolution of computing as well as give a perspective of the future of computer science and technology. |
关 键 词: | 计算机科学; 逻辑; 复杂性科学 |
课程来源: | 视频讲座网 |
最后编审: | 2020-06-12:邬启凡(课程编辑志愿者) |
阅读次数: | 53 |