CmpE 415 - Theory of Computation

Fall Semester 2010  

Announcements

· Final exam results (out of 100): (You can see your papers only on Thursday, January 20, between 11:00 and 12:00.)

Danişger	72
Demirci	86
Güveniş	66
Salehi	61
Yalı	34

· Second midterm results (out of 100):

Danişger	36
Demirci	61
Güveniş	54
Kayır	21
Salehi	38
Yalı	30

· Your midterm results (out of 75) are:

Danişger	56
Demirci	75
Güveniş	56
Kayır	11
Salehi	72
Temiz	16
Yalı	21

· Note the change in the midterm date.

· The midterm dates are announced below.

· New announcements will be added to the top as they arrive. Please follow this announcements page frequently.

---

Catalog Data:	Basic concepts of computation. The theory and representation of algorithms and models of computation. Computability and recursive functions. Formal specification and proofs of programs. Automata theory.
Textbook:	Michael Sipser. Introduction to the theory of Computation, 2nd ed.
Instructor:	Cem Say

Prerequisite:

CMPE220 , CmpE 350

Topics (subject to change):

1. The Church-Turing Thesis
2. Decidability
3. Reducibility
4. Advanced Topics in Computability Theory
5. Complexity Theory

Exams:

• Midterm 1: November 10
• Midterm 2: December 15
• and the final exam

Computer Usage:

None

Laboratory projects:

None.

Mathematics:

A lot of proofs and hard work.

---