18.404/6.840 Lecture 10 Last time: - The

liane-varnes
Published  · 15 slides · 0 views
↓ Download
18.404/6.840 Lecture 10 Last time: - The
1 / 1
18.404/6.840 Lecture 10 Last time: - The - slide 1 of 15 18.404/6.840 Lecture 10 Last time: - The - slide 2 of 15 18.404/6.840 Lecture 10 Last time: - The - slide 3 of 15 18.404/6.840 Lecture 10 Last time: - The - slide 4 of 15 18.404/6.840 Lecture 10 Last time: - The - slide 5 of 15 18.404/6.840 Lecture 10 Last time: - The - slide 6 of 15 18.404/6.840 Lecture 10 Last time: - The - slide 7 of 15 18.404/6.840 Lecture 10 Last time: - The - slide 8 of 15 18.404/6.840 Lecture 10 Last time: - The - slide 9 of 15 18.404/6.840 Lecture 10 Last time: - The - slide 10 of 15 18.404/6.840 Lecture 10 Last time: - The - slide 11 of 15 18.404/6.840 Lecture 10 Last time: - The - slide 12 of 15 18.404/6.840 Lecture 10 Last time: - The - slide 13 of 15 18.404/6.840 Lecture 10 Last time: - The - slide 14 of 15 18.404/6.840 Lecture 10 Last time: - The - slide 15 of 15
Description
18.4046.840 Lecture 10 Last time: - The Reducibility Method for proving undecidability and T-unrecognizability - General reducibility - Mapping reducibility Today: (Sipser 5.2) - The Computation History Method for proving undecidability -

Related Topics

Download this presentation From Below

"18.404/6.840 Lecture 10 Last time: - The" is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.

Presentation Transcript

01
18.404/6.840 Lecture 10 Last time: - The Reducibility Method for proving undecidability and T-unrecognizability
- General reducibility
- Mapping reducibility

Today: (Sipser §5.2) - The Computation History Method for proving undecidability
- The Post Correspondence Problem is undecidable
- Linearly bounded automata
- Undecidable problems about LBAs and CFGs<br>
02
Remember<br>
03
Revisit Hilbert’s 10th Problem<br>