TuringMachines

TuringMachines - Turing Machines Chapter 3.1 1 Plan Turing...

Info iconThis preview shows pages 1–9. 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

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: Turing Machines Chapter 3.1 1 Plan Turing Machines(TMs) Alan Turing Church-Turing Thesis Definitions Computation Configuration Recognizable vs. Decidable Examples Simulator 2 Alan Turing Alan Turing was one of the founding fathers of CS. His computer model the Turing Machine (1936) was the inspiration for the electronic computer that came two decades later Was instrumental in cracking the Nazi Enigma cryptosystem in WWII Invented the Turing Test used in AI The Turing Award. Pre-eminent award in Theoretical CS (called the Nobel Prize of CS) 3 Church-Turing Thesis Thesis- Every effectively calculable function is a computable function Everything that is computable is computable by a Turing machine The thesis remains a hypothesis Despite the fact that it cannot be formally proven the ChurchTuring thesis now has near-universal acceptance. 4 Turing Machine Most powerful machine so far Similar to a finite automata 1. Uses infinite tape as memory 2. Can both read from and write to the tape 3. Read/write head can move left/right 4. Accept/reject take affect immediately Cannot solve all problems Comparison with Previous Models 6 Device Separate Input? Read/Write Data Structure Deterministic by default? FA Yes None Yes PDA Yes LIFO Stack No TM No 1-way infinite tape. 1 cell access per step. Yes Formal Definition of a TM 7 Successor Program Sample Rules: 1. If read 1, write 0, go right, repeat....
View Full Document

Page1 / 38

TuringMachines - Turing Machines Chapter 3.1 1 Plan Turing...

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

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