CSCI 361 Fall 2014 Theory of Computation (Q)

Cross Listed as MATH361
This course introduces a formal framework for investigating both the computability and complexity of problems. We study several models of computation including finite automata, regular languages, context-free grammars, and Turing machines. These models provide a mathematical basis for the study of computability theory--the examination of what problems can be solved and what problems cannot be solved--and the study of complexity theory--the examination of how efficiently problems can be solved. Topics include the halting problem and the P versus NP problem.
Class Format: lecture
Requirements/Evaluation: evaluation will be based on problem sets, a midterm examination, and a final examination
Additional Info:
Additional Info2:
Prerequisites: CSCI 256 or both a 300-level MATH course and permission of instructor
Enrollment Preference: current or expected Computer Science majors
Department Notes:
Material and Lab Fees:
Distribution Notes:
Divisional Attributes: Division III,Quantitative and Formal Reasoning
Other Attributes: COGS Interdepartmental Electives
Enrollment Limit: 40
Expected Enrollment: 40
Class Number: 1427
CLASSES ATTR INSTRUCTORS TIMES CLASS NUMBER
CSCI 361 - 01 (F) LEC Theory of Computation (Q) Division 3: Science and MathematicsQuantitative and Formal Reasoning Brent A. Heeringa
MWF 12:00 PM-12:50 PM Physics 205 1427
Course Search
Term:
Subject:
Catalog Number:
Division:
Distribution:
Subject Attributes:
Enrollment Limit:
Course Type:
Start Time: End Time:
Day(s):
Instructor First Name:
Instructor Last Name:
Keyword Search: