# Difference between revisions of "Theory/spring2020"

From Maryville College CS Wiki

< Theory

Robert.lowe (talk | contribs) (→Peer Reviewed Papers) |
Robert.lowe (talk | contribs) (→Homework) |
||

(One intermediate revision by the same user not shown) | |||

Line 21: | Line 21: | ||

# [http://www.jamesrmeyer.com/pdfs/godel-original-english.pdf On Formally Undecidable Propositions of Principia Mathematica]. Kurt Godel 1931. Translated by Meltzer. | # [http://www.jamesrmeyer.com/pdfs/godel-original-english.pdf On Formally Undecidable Propositions of Principia Mathematica]. Kurt Godel 1931. Translated by Meltzer. | ||

## [http://hirzels.com/martin/papers/canon00-goedel.pdf Alternate translation of Sections 1 and 2]. Kurt Godel 1931. Translated by Martin Hirzel. | ## [http://hirzels.com/martin/papers/canon00-goedel.pdf Alternate translation of Sections 1 and 2]. Kurt Godel 1931. Translated by Martin Hirzel. | ||

+ | # [https://www.ics.uci.edu/%7Elopes/teaching/inf212W12/readings/church.pdf An Unsolvable Problem of Elementary Number Theory]. Alonzo Church. April 1936 | ||

+ | ## [https://learnxinyminutes.com/docs/lambda-calculus/ Learn Lambda Calculus in Y Minutes] | ||

== Homework == | == Homework == | ||

Line 26: | Line 28: | ||

# [[media:CSC381-Spring2020-02-Principia.pdf|Principia Mathematica Problem Set]] | # [[media:CSC381-Spring2020-02-Principia.pdf|Principia Mathematica Problem Set]] | ||

# [[media:CSC381-Spring2020-03-Godel-1.pdf|Godel Problem Set 1]] | # [[media:CSC381-Spring2020-03-Godel-1.pdf|Godel Problem Set 1]] | ||

+ | # [[media:CSC381-Spring2020-04-Godel-2.pdf|Godel Problem Set 2]] | ||

== Peer Reviewed Papers == | == Peer Reviewed Papers == | ||

[[Theory/spring2020/Paper_Submission|Paper Submission Standards]] | [[Theory/spring2020/Paper_Submission|Paper Submission Standards]] | ||

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

## Latest revision as of 10:39, 12 February 2020

## 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 |

## Readings

- On an Elementary Question in the Theory of Manifolds. Georg Cantor 1891. Translated by Peter P Jones (2019)
- The Crisis in the Foundation of Mathematics by Jose Ferreiros. Chapter II.7 of
*Princeton Companion to Mathematics*. Princeton University Press. 2008 - Principia Mathematica by A. N. Whitehead and Bertrand Russell
- On Formally Undecidable Propositions of Principia Mathematica. Kurt Godel 1931. Translated by Meltzer.
- Alternate translation of Sections 1 and 2. Kurt Godel 1931. Translated by Martin Hirzel.

- An Unsolvable Problem of Elementary Number Theory. Alonzo Church. April 1936

## Homework

## Peer Reviewed Papers

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