ΕΠΛ211: Θεωρία Υπολογισμού και Πολυπλοκότητα

Related Links


Συνδέσμοι σε θέματα σχετικά με το μάθημα.

Ιστοσελίδα μαθημάτων:

 

The Church-Turing Thesis. Copeland, B. Jack. The Stanford Encyclopedia of Philosophy. Fall 2008 Edition.
The Status of the P versus NP Problem. Lance Fortnow. Communications of the ACM. Vol. 52 No. 9, Pages 78-86, September 2009.
On P, NP, and Computational Complexity. Moshe Y. Vardi. Communications of the ACM. Vol. 53 No. 11, Page 5, November 2010.
Solving the Unsolvable. Moshe Y. Vardi. Communications of the ACM. Vol. 54 No. 7, Page 5, July 2011.
An Interview with Stephen A. Cook. Philip L. Frana. Communications of the ACM. Vol. 55 No. 1, Pages 41-46, January 2012.
Andrew Hodges Alan Turing Home Page.

The Lego Turing Machine.

A Turing Machine in the classic style.

An essay on Computability and Complexity by Jon Kleinberg and Christos Papadimitriou

 
Main Course Page
Class Contract
Assignments
Course Schedule
 What's New?
 Class Notes
Assignment Solutions
Tutorials