CS 2110 Theory of Computation

Description

This course deals with computability theory, automata theory and formal languages. Various models of computation will be examined, their relations to each other and their properties will be studied. Topics include models for computable functions and Church's thesis, models for recognizers and their relation to formal grammars, algorithmically solvable and insolvable problems, and the complexity of computations.

  • Credits: 3

Prerequisites

Requirements and Grading

Current Sections

Spring 2019

Class No.
Days
Times
Room
Instructor(s)
TA(s)
Type
Session
Writing
Class No.: 32460 (1010)
Days: F
Times: 9:30 am - 10:45 am
Room: IS 405
Instructor(s): K. Pruhs
TA(s): K. Pruhs
Type: REC
Session: AT
Writing:
Class No.: 27570 (1010)
Days: MW
Times: 9:30 am - 10:45 am
Room: IS 405
Instructor(s): K. Pruhs
TA(s):
Type: LEC
Session: AT
Writing:

Past Sections

Please click the headings below to view the hidden sections.