Legacy Course Catalog

C S 483 - Introduction To The Theory Of Computation

Effectivity: 08/20/2001 - 12/14/2002 @ Purdue West Lafayette Traditional
Credits: 3
Instructional Types: Lec
Usually Offered: spr
Short Title: Theory Computation
Description: Restricted models of computation: finite automata and pushdown automata. Grammars and their relation to automata. Closure properties and pumping lemmas. Turing machines and the Church-Turing thesis. Limits of computation: uncomputable functions, undecidable problems.
School: School Of Science
Department: Computer Science
Credit By Exam: NO
Repeatable Flag: NO
Temporary Flag: NO
Full Time Privilege Flag: NO
Honors Flag: NO
Registration Approval Type: Department
Variable Title Flag: NO

Fall 2007 *** indicates the course was still an active course and was transferred to the Banner Catalog effective Spring 2008. This course was not expired Fall 2007.

Purdue University, 610 Purdue Mall, West Lafayette, IN 47907, (765) 494-4600

2018 Purdue University | An equal access/equal opportunity university | Copyright Complaints | Maintained by Office of Registrar

Need accessibility help? For help with this page, contact Office of the Registrar at registrar@purdue.edu.