This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CS 530 Theory of Computation Tentative Syllabus (version 1.0) Gruia Calinescu Department of Computer Science Illinois Institute of Technology Fall 2010 1 Course Summary Welcome to CS 530 Theory of Computation. This is a theoretical computer science graduate course. The main thrust is to identify the limitations of the computers through formaliz- ing computation (by introducing several models including Turing Machines) and applying mathematical techniques to the formal models obtained. There is significant overlap with CS 532 (Formal Languages). I recommend you do not take both courses. Further study of Complexity Theory shows that a large set of practical problems, while solvable in exponential time, seem to not have efficient algorithms. This part of CS 530 can be seen as a counterpart to CS 535 - Analysis of Algorithms. Complexity Theory can also be applied to show that certain problems do not allow parallel algorithms. But sometimes we are looking for hard problems! When designing a cryptographic code, we would like that breaking the code to be hard. We may investigate this subject towards the end of the semester. 2 Textbook The required textbook is Introduction to Theory of Computation by Michael Sipser, Thom- son, 2006. It should be available at the bookstore. The first edition of the book will be fine for learning, but there may be differences in the assigned exercises and problems....
View Full Document
This note was uploaded on 09/28/2010 for the course CS 530 taught by Professor Cs530 during the Spring '08 term at Illinois Tech.
- Spring '08
- Computer Science