User Tools
courses:theory2016:main
Differences
This shows you the differences between two versions of the page.
|
courses:theory2016:main [2016/04/27 11:03] tsay [Announcements] |
courses:theory2016:main [2016/08/31 12:46] (current) tsay [Announcements] |
||
|---|---|---|---|
| Line 4: | Line 4: | ||
| =====Announcements===== | =====Announcements===== | ||
| + | * 07/03: grade report available; please send inquiries, if any, to the instructor by 2PM 07/04. | ||
| + | * 06/08: slides from TA sessions: {{courses:theory2016:toc_ta1.pptx|HW#1-2}}, {{courses:theory2016:toc_ta2.pptx|HW#3-5}}, {{courses:theory2016:toc_ta3.pptx|HW#6-7}}, {{courses:theory2016:toc_ta4.pptx|HW#8-10}}. | ||
| + | * 06/08: {{courses:theory2016:hw10.pdf|HW#10}} due on 06/15. | ||
| + | * 05/25: {{courses:theory2016:hw9.pdf|HW#9}} due on 06/01. | ||
| + | * 05/25: notes/slides for Time Complexity and NP-Completeness available. | ||
| + | * 05/17: {{courses:theory2016:hw8.pdf|HW#8}} due on 05/25. | ||
| + | * 05/17: notes/slides for Reducibility available. | ||
| + | * 05/11: {{courses:theory2016:theory2016mid_s.pdf|Suggested Solutions to Midterm Problems}} available. | ||
| + | * 05/04: notes/slides for Decidability available. | ||
| + | * 04/28: {{courses:theory2016:hw7.pdf|HW#7}} due on 05/11. | ||
| * 04/27: notes/slides for Turing Machines available. | * 04/27: notes/slides for Turing Machines available. | ||
| * 04/11: old exams: {{courses:theory:old_exams.zip|2000-2015}}. | * 04/11: old exams: {{courses:theory:old_exams.zip|2000-2015}}. | ||
| Line 49: | Line 59: | ||
| * **Midterm** (**2016/04/20**) | * **Midterm** (**2016/04/20**) | ||
| *Turing Machines (2 weeks: 4/27, 5/4) [{{courses:theory2016:ch3_notes.pdf|notes}}, {{courses:theory2016:ch3_slides.pdf|slides}}] | *Turing Machines (2 weeks: 4/27, 5/4) [{{courses:theory2016:ch3_notes.pdf|notes}}, {{courses:theory2016:ch3_slides.pdf|slides}}] | ||
| - | *Decidability and Undecidability (1 week: 5/11*) [{{courses:theory2016:ch4_notes.pdf|notes}}, {{courses:theory2016:ch4_slides.pdf|slides}}] | + | *Decidability (and Undecidability) (1 week: 5/11*) [{{courses:theory2016:ch4_notes.pdf|notes}}, {{courses:theory2016:ch4_slides.pdf|slides}}] |
| *Reducibility (2 weeks: 5/18, 5/25) [{{courses:theory2016:ch5_notes.pdf|notes}}, {{courses:theory2016:ch5_slides.pdf|slides}}] | *Reducibility (2 weeks: 5/18, 5/25) [{{courses:theory2016:ch5_notes.pdf|notes}}, {{courses:theory2016:ch5_slides.pdf|slides}}] | ||
| *Time Complexity and NP-Completeness (3 weeks: 6/1, 6/8*, 6/15) [{{courses:theory2016:ch7_notes.pdf|notes}}, {{courses:theory2016:ch7_slides.pdf|slides}}] | *Time Complexity and NP-Completeness (3 weeks: 6/1, 6/8*, 6/15) [{{courses:theory2016:ch7_notes.pdf|notes}}, {{courses:theory2016:ch7_slides.pdf|slides}}] | ||
courses/theory2016/main.1461726195.txt.gz ยท Last modified: 2016/04/27 11:03 by tsay
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 3.0 Unported
