1 / 10

The Theory of Computation

The Theory of Computation course is offered in the Fall semester of 2014 at National Taiwan University. Topics covered include sets, relations, languages, finite automata, Turing machines, undecidability, computational complexity, and NP-completeness. The course grading includes homework assignments, exams, and oral presentations. The textbook used is "Elements of the Theory of Computation" by Harry R. Lewis and Christos H. Papadimitriou.

rshields
Download Presentation

The Theory of Computation

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. The Theory of Computation Kun-Mao Chao (趙坤茂) National Taiwan University http://www.csie.ntu.edu.tw/~kmchao/

  2. About this course • Course: The Theory of Computation (限在職生選修; This evening class is for part-time studentsonly.) • Fall semester, 2014 • 18:30 – 21:15 Tuesday, R439 CSIE Building. • 3 credits • Web site: http://www.csie.ntu.edu.tw/~kmchao/theory14fall • Instructor: Kun-Mao Chao (趙坤茂) • Teaching assistant: Yen-Wei Wu (吳彥緯)

  3. Instructor: Kun-Mao Chao (趙坤茂) &TA: Yen-Wei Wu (吳彥緯) Yen-Wei Wu Kun-Mao Chao

  4. Topics • Sets, Relations, Languages • Finite Automata • Context-free Languages • Turing Machines • Undecidability • Computational Complexity • NP-completeness • Related Topics

  5. Grading policy • Homework assignments and Class participation (10%) • Two midterm exams (70%; 35% each): • Midterm #1: Oct. 28, 2014 (tentative) • Midterm #2: Dec. 9, 2014 (tentative) • Oral presentation of selected papers/topics (20%) • Dec. 30, 2014 and Jan. 6, 2015

  6. Textbook • Elements of the Theory of Computation, Second Edition • by Harry R. Lewis and Christos H. Papadimitriou, Prentice-Hall, 1998.

  7. Textbook -- aglance

  8. Other matters • No class on Dec. 16, 2014 • Popular X problems on Dec. 23, 2014 • Class presentations on Dec. 30, 2014 and Jan. 6, 2015: TBA

  9. Top ten reasons for taking this class 10. You may bring your dinner to the class as long as it is not stinky and you clean up your table afterwards. 9. A good mental exercise. 8. To learn more about theoretical computer science. 7. To sharpen your skills in proving theorems. 6. To learn more about computation.

  10. Top ten reasons for taking this class 5. To improve your programming ability. 4. To explore the pleasure of pressure. 3. To figure out your potential that you never knew. 2. To get inspired. 1. You tell me!

More Related