CS 441
Theory of Computation

Credits/When Offered: 4R-0L-4C / F 1996-97

Prerequisites: CS 233 and MA 315.

Theoretical and mathematical issues in computer science. Automata, grammars, formal languages. Turing machines, the halting problem, undecidability, computability theory, recursive functions.

Explain the notation used here.

white_icon.gif (851 bytes)Required Courses
cs_icon.gif (891 bytes)Computer Science
rhit_icon.gif (977 bytes)Rose-Hulman

09-Feb-1999 20:02:15