CSC381 - Theory of Computation

< Theory
Revision as of 10:23, 28 February 2020 by Robert.lowe (talk | contribs) (Peer Reviewed Papers)

Revision as of 10:23, 28 February 2020 by Robert.lowe (talk | contribs) (Peer Reviewed Papers)


Course Information

Code CSC3810
Name Theory of Computation
Credit(s) 3
Prerequisites CSC2310
Offered Fall of every odd numbered year. (2015, 2017, etc.) or sometimes the Spring of an even numbered year (like 2020).
Catalog Description A study of theoretical models of computing, including finite state machines, pushdown automata, context-free grammars, and Turing machines. The concepts of decidability, complexity theory, and NP-Completeness will be studied in depth.
Syllabus Spring 2020 Syllabus
Other Offerings Theory/offerings


  1. On an Elementary Question in the Theory of Manifolds. Georg Cantor 1891. Translated by Peter P Jones (2019)
  2. The Crisis in the Foundation of Mathematics by Jose Ferreiros. Chapter II.7 of Princeton Companion to Mathematics. Princeton University Press. 2008
  3. Principia Mathematica by A. N. Whitehead and Bertrand Russell
    1. Volume 1
    2. Volume 2
    3. Volume 3
  4. On Formally Undecidable Propositions of Principia Mathematica. Kurt Godel 1931. Translated by Meltzer.
    1. Alternate translation of Sections 1 and 2. Kurt Godel 1931. Translated by Martin Hirzel.
  5. An Unsolvable Problem of Elementary Number Theory. Alonzo Church. April 1936
    1. Learn Lambda Calculus in Y Minutes
  6. On Computable Numbers With an Application to the Entscheidungsproblem. Alan Turing. November 1936


Peer Reviewed Papers

Paper Submission Standards

Step by step guide to reviewing a manuscript

Peer Review Submission Guidelines

  1. Peer Review Paper 1 is Due February 28, 2020 (See MCTOC for inspiration).