COMP 4601 - Models of Computation

(3) Computer models as basis for the understanding and analysis of programming, computation and complexity; machine models (finite-state, stack and Turing machines); linguistic models (grammars, lambda calculus, predicate calculi); biologically-inspired models (e.g. neural nets or genetic algorithms); unsolvability, universality, decidability, feasibility. (F, Sp) PREREQUISITE: COMP 4030, or permission of instructor.