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: Variable
  • Frequency: Every term

Prerequisites

Requirements and Grading

Current Sections

Spring 2017

Class Number Days Hours Room Instructor TA/Grader Dept/Limit Type Session Writing
26959(1511) MWF 9:30 am - 10:45 am SENSQ 5313 K. Pruhs
CS/13 LEC TERM

Past Sections

To view the sections for a term, click on it's name below.

Spring 2016

Class Number Days Hours Room Instructor TA/Grader Dept/Limit Type Session Writing
28805(1511) MWF 9:30 am - 10:45 am SENSQ 5505 K. Pruhs
CS/13 LEC TERM