CS 2110 THEORY OF COMPUTATION

Description

Minimum Credits: 3
Maximum Credits: 3
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 unsolvable problems, and the complexity of computations.
Academic Career: Graduate
Course Component: Lecture
Grade Component: Grad LG/SNC Basis
Course Requirements: PLAN: Computer Science (CS-PHD; CS-MS; CSMSBS-MS) or Computer Engineering (COEAS-PHD; COEAS-MS; COEENG-PHD; COEENG-MCO)

Current Sections

Spring 2020

Class No.
Days
Times
Room
Instructor(s)
TA(s)
Type
Session
Writing
Class No.: 26535 (1010)
Days: MW
Times: 9:30 am - 10:45 am
Room: IS 305
Instructor(s): J. Aronis
TA(s):
Type: LEC
Session: AT
Writing:

Past Sections

Please click the headings below to view the hidden sections.