Departmental Mission and Goals
Faculty and Staff
Programs Offered
Course Descriptions
Careers
Alumni Achievements
Current Students
Maharishi Vedic Mathematics
Math Placement
Home >  MUM Home >  Academics >  Academic Departments >  Mathematics >  Course Descriptions > 

back

MATH 485 Theory of Computation

The Laws That Govern the Self-Interacting Dynamics of Numbers and Their Application

Students focus on formal abstract models of computation and capabilities of abstract machines in relation to their increasing ability to recognize more general classes of formal languages. Topics include formal grammars, finite-state machines, equivalence of finite-state machines, right-linear and left-linear grammars, pushdown automata, context-free languages, Turing machines, unsolvable problems, and recursive functions. (4 credits) Prerequisite: MATH 272

back

 
 
 
search login