- From www.edx.org
Introduction to Theoretical Computer Science 理论计算机科学基础
You can't access an archived course
- 13 Sequences
- Introductive Level
- Starts on September 20, 2015
- Ends on December 14, 2015
Course details
Syllabus
点击上方绿色按钮报名。
- 语言与自动机理论、可计算性理论、计算复杂性理论等最基本的那部分内容
- 什么是有效计算, 什么是计算
- 学生将了解计算理论的基础知识,掌握有效计算的概念
- Background and history of automata, computability and computational complexity theories
- What issues are not calculated and why
- What are considered efficient and inefficient calculations
Prerequisite
Instructors
- 刘 田
Platform
Harvard University, the Massachusetts Institute of Technology, and the University of California, Berkeley, are just some of the schools that you have at your fingertips with EdX. Through massive open online courses (MOOCs) from the world's best universities, you can develop your knowledge in literature, math, history, food and nutrition, and more. These online classes are taught by highly-regarded experts in the field. If you take a class on computer science through Harvard, you may be taught by David J. Malan, a senior lecturer on computer science at Harvard University for the School of Engineering and Applied Sciences. But there's not just one professor - you have access to the entire teaching staff, allowing you to receive feedback on assignments straight from the experts. Pursue a Verified Certificate to document your achievements and use your coursework for job and school applications, promotions, and more. EdX also works with top universities to conduct research, allowing them to learn more about learning. Using their findings, edX is able to provide students with the best and most effective courses, constantly enhancing the student experience.