From e95e79364feaf44312f883a76de9b61729ea9e23 Mon Sep 17 00:00:00 2001 From: Teresa Carbajo-Garcia <t.carbajo-garcia@imperial.ac.uk> Date: Wed, 10 Oct 2018 16:39:02 +0100 Subject: [PATCH] Update ModelsComputation.md --- teaching/ModelsComputation.md | 16 ++++++++-------- 1 file changed, 8 insertions(+), 8 deletions(-) diff --git a/teaching/ModelsComputation.md b/teaching/ModelsComputation.md index 8579287..14d04f3 100644 --- a/teaching/ModelsComputation.md +++ b/teaching/ModelsComputation.md @@ -14,26 +14,24 @@ The course focuses on teaching students the fundamental skills involved in deali #### Description of the Course This course provides a whirlwind tour of some of the key concepts in theoretical computer science. In particular, we will study formal descriptions (models) of computational behaviour. -The course intends to make sure that all students establish a stronger foundation in the more theoretical side of Computer Science, thus better preparing them for the courses that will follow in the fourth year. #### Course Outline The course comprises two hours a week for seven weeks. -#### General Information for 2017 autumn term +#### General Information for 2018 autumn term -Time: Wednesdays: 9am - 11am (Tutorial from 10am) +Time: Wednesdays: 9am - 11am, Room 308. -Thursdays: 12 - 2pm (Optional tutorial from 1pm, from week 4) +Thursdays: 12 - 1pm, Room 311. Coursework Schedule: -Assesed coursework 1: published Friday 3rd Nov / deadline for submission Monday 20th Nov by 12 noon +Assesed coursework 1: published Wed 31st Oct, 9 AM / deadline for submission Fri 9th Nov, 4 PM -Assesed coursework 2: distributed on Friday 1st Dec / deadline for submission Friday 15th Dec by 12 noon - -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. +Assesed coursework 2: published Wed 28th Nov, 9 AM / deadline for submission Tue 11th Dec, 4 PM +Tutorials: Tutorial exercises will be posted online (here and on CATE) before the tutorial each week, printed copies will also be available. Tutorial solutions will be published online 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. @@ -65,3 +63,5 @@ Other Recommendations: [Logicomix](http://www.logicomix.com/en/): the graphic n [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. A real [Turing machine.](http://robotzeitgeist.com/2010/03/model-turing-machine.html) + +[LEGO Turing Machine]. (https://www.youtube.com/watch?v=cYw2ewoO6c4) -- GitLab