1 / 7

CS5371 Theory of Computation

CS5371 Theory of Computation. General Info, Scope, Textbook Assessment, …. General Information. Web page: http://is.cs.nthu.edu.tw/course/2009Fall/CT537100/ Lecturer: Hung-Min Sun ( 孫宏民 ), hmsun@cs TA: 陳宣同 , rickrick@is.cs.nthu.edu.tw Meeting times: Tue 1410 — 1500, Fri 1520 —1710

skyler-bradshaw
Télécharger la présentation

CS5371 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. CS5371Theory of Computation General Info, Scope, Textbook Assessment, …

  2. General Information • Web page: • http://is.cs.nthu.edu.tw/course/2009Fall/CT537100/ • Lecturer: • Hung-Min Sun (孫宏民), hmsun@cs • TA: • 陳宣同, rickrick@is.cs.nthu.edu.tw • Meeting times: • Tue 1410 — 1500, Fri 1520 —1710 • Consultation: • Send us email for appointments!!

  3. What will you learn from this course? • How to define a computer? • Are there problems that a computer cannot solve? If so, can we find one such problem? Automata theory Computability theory

  4. Part I: Automata Theory • Study very simple “computer” called automaton (plural: automata) • Though very simple, they can solve some decision problems. E.g., is an input sequence of 0s and 1s, such as 101110101, representing a binary number divisible by 5? • Study what kind of decision problems can be solved by automaton? What kind of decision problems cannot be solved?

  5. Part II: Computability Theory • Introduce a slightly more complicated computer called “Turing Machine” • We will show that (in some sense) Turing Machine has the same power as an ordinary computer • Show that some problems (although sounds like easy) cannot be solved by computers

  6. Textbook & References • Textbook • Introduction to the Theory of Computation (2nd Edition), by Michael Sipser • We will follow very closely to this book • References • Computational Complexity, by C. Papadimitiou • Introduction to Automata Theory, Languages, and Computation, by J. Hopcroft, R. Motwani, and J. Ullman.

  7. Assessment Assignments + Quits: 40% Midterm: 30% Final Exam: 30% ------------------------------------------ Total 100%

More Related