From 0cd34b582897e46447b318d1cce55e8385e10e1f Mon Sep 17 00:00:00 2001 From: Teresa Carbajo-Garcia <t.carbajo-garcia@imperial.ac.uk> Date: Mon, 21 Nov 2016 15:37:22 +0000 Subject: [PATCH] Update ModelsComputation.md --- teaching/ModelsComputation.md | 9 ++++++--- 1 file changed, 6 insertions(+), 3 deletions(-) diff --git a/teaching/ModelsComputation.md b/teaching/ModelsComputation.md index b6a1427..95f15ce 100644 --- a/teaching/ModelsComputation.md +++ b/teaching/ModelsComputation.md @@ -21,11 +21,14 @@ The course comprises two hours a week for seven weeks. #### General Information Time: Wednesdays: 9am - 11am (Tutorial from 10am) + Thursdays: 12 - 1pm + Coursework Schedule: Coursework 1: published 4th Nov / deadline 20th Nov 2pm + Coursework 2: published 2nd Dec / deadline 14th Dec 2pm -Tutorials: Tutorial exercises will be posted online before the tutorial each week, printed copies will also be available. -Tutorial solutions will be published here before the next week's tutorial. + +Tutorials: Tutorial exercises will be posted online before the tutorial each week, printed copies will also be available. Tutorial solutions will be published here before the next week's tutorial. Recommended Reading: H.R. Nielson and F. Nielson (1999). Semantics with Applications: A Formal Introduction, originally published in 1992 by John Wiley and Sons. @@ -53,7 +56,7 @@ T.A. Sudkamp (1995). Languages and Machines, 2nd edition, Addison-Wesley. Other Recommendations: [Logicomix](http://www.logicomix.com/en/): the graphic novel Logicomix was inspired by the epic story of the quest for the Foundations of Mathematics... http://www.logicomix.com/en/ -[Turing](http://www.amazon.com/Turing-Novel-Computation-Christos-Papadimitriou/dp/0262162180)(A Novel about Computation), Christos Papadimitriou, Berkeley. +[Turing](http://www.amazon.com/Turing-Novel-Computation-Christos-Papadimitriou/dp/0262162180) (A Novel about Computation), Christos Papadimitriou, Berkeley. [Scooping the Loop Snooper](http://www.cl.cam.ac.uk/teaching/0910/CompTheory/scooping.pdf)(© Mathematical Association of America), a poetic proof of the undecidability of the halting problem in the style of Dr Seuss by Geoffrey K. Pullum. -- GitLab