Theoretical analysis of the computational process; fundamental concepts such as abstract programs, classes of computational machines and their equivalence, recursive function theory, unsolved problems, Church's thesis, Kleene's theorem, program equivalence, and generability, acceptability, decidability. Pre: MATH 3134 or 3034; (3H, 3C), I.