Course Information

Course Name	Turkish	Hesaplama Kuramı
	English	Theory of Computation
Course Code	BLG 557E	Credit	Lecture (hour/week)	Recitation (hour/week)	Laboratory (hour/week)
Semester	1	3	3	-	-
Course Language		English
Course Coordinator		Tolga Ovatman
Course Objectives		1. To provide a general overview of computation and complexity issues. 2. To discuss basic principles of computability. 3. To discuss basic principles of complexity. 4. To ensure that students have the necessary research skills to apply basic computability analysis using fundamental computation models.
Course Description		Overview of types of formal languages and automata and recursively enumerable languages, computation models and computability, decidability and reducibility, introduction of advanced topics in theory of computation, space and time complexity, intractability, introduction of advanced topics in theory of complexity.
Course Outcomes		1. To be able to apply computability and complexity analysis on a computation problem. 2. To understand and analyze decidability characteristics of a computation problem. 3. To understand complexity classes and to be able to apply reduction on problems. 4. To grasp the basic idea of intractability of a computation problem.
Pre-requisite(s)
Required Facilities
Other
Textbook		• Sipser M., Introduction to the Theory Of Computation 3rd Edition, Cengage Learning, 2013 • Martin J.C., Introduction To Languages And The Theory Of Computation 4th Edition, Mcgraw-Hill, 2011 • Attalah M.J., Blanton M., Algorithms And Theory Of Computation Handbook Vol.2:Special Topics And Techniques 2nd Edition, CRC Press, 2010
Other References

Courses

Help

About