Undergraduate Degree & Course Catalog

Help & Advanced Search Features

Tips & Tricks

Course Search

CSE 396LR Intro Theory of Computatn
Computer Science & Engineering

Covers machine models and formal specifications of the classes of computational problems they can solve. The central concepts are the Turing machine and the classes of decidable and computably enumerable languages. The Halting Problem and other natural problems are shown to be undecidable by Turing machines, implying that they are undecidable by high-level programming languages or any other known computational model. Finite automata, which are Turing machines without external memory, are shown to correspond to the class of regular languages. The course also covers regular expressions, time and space complexity of Turing machines, reducibility between problems, and NP-completeness.

Credits: 4
Semester(s) Typically Offered: Spring
Grading: Graded (GRD)
Pre-Requisites: CSE 191 or MTH 311 and CSE 250, and MTH 142 Approved Computer Science, Computer Engineering, Bioinformatics/CS Majors Only

Reg # Alt Title Section Dates Days Time Type Instructor
{{course | enrollmentAllowedFltr}} {{course | altTitleFltr}} {{course.section}} {{course.start.date | date:'MMM d'}} - {{course.end.date | date:'MMM d'}} {{course.when[0].pattern}} {{course.start.time | military2RegularFltr}} - {{course.end.time | military2RegularFltr}} {{course.catalog.type_pk}} {{course.instructor}}
No classes scheduled for this course during the {{rsC.scheduleErrors[0]}} semester.