Go to Main Content

Georgia Tech

 

HELP | EXIT

Catalog Entries

 

Spring 2022
Jun 25, 2024
Transparent Image
Information The pre-requisites listed in this catalog are those approved by the Curriculum Committee.
For pre-requisite information specific to an individual instance of a course, please see the schedule of classes.
Click the Schedule Type to find available offerings of the course on the Schedule of Classes.

CS 4510 - Automata and Complexity
Computational machine models and their language classes. Undecidability. Resource-bounded computations. Central complexity-theoretic concepts such as complexity classes, reducibility and completeness.
3.000 Credit hours
3.000 Lecture hours

Grade Basis: ALP
All Sections for this Course

Dept/Computer Science Department

Course Attributes:
Tech Elect CS, Engr, &Sciences, Theory (CS)


Return to Previous New Search XML Extract
Transparent Image
Skip to top of page
Release: 8.7.2.4GT