TM - Harvard CS 121 and CSCI E-207 Lecture 12: Turing...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Harvard CS 121 and CSCI E-207 Lecture 12: Turing Machines Harry Lewis October 15, 2009 Reading: Sipser, 3.1. Harvard CS 121 & CSCI E-207 October 15, 2009 Turing Machines Objective: Define a computational model that is General-purpose: (as powerful as programming languages) Formally Simple: (we can prove what cannot be computed) 1 Harvard CS 121 & CSCI E-207 October 15, 2009 The Origin of Computer Science Alan Mathison Turing On Computable Numbers, with an Application to the Entscheidungsproblem 1936 11/02 turing.jpg 170 ! 201 pixels 2 Harvard CS 121 & CSCI E-207 October 15, 2009 What Problem Was Turing Trying to Solve? David Hilbert Mathematical Problems 1900 3 Harvard CS 121 & CSCI E-207 October 15, 2009 The Logicians Kurt Godel On Formally Undecidable Propositions . . . 1931 Alonzo Church An Unsolvable Problem of Elementary Number Theory 1936 4 Harvard CS 121 & CSCI E-207 October 15, 2009 The Basic Turing Machine The Basic Turing Machine...
View Full Document

This document was uploaded on 12/24/2011.

Page1 / 13

TM - Harvard CS 121 and CSCI E-207 Lecture 12: Turing...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online