
17. Space Complexity, PSPACE, Savitch's Theorem
0:00
1:26:54
MIT 18.404J Theory of Computation, Fall 2020Instructor: Michael SipserView the complete course: https://ocw.mit.edu/18-404JF20YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP60_JNv2MmK3wkOt9syvfQWYUploaded 06-10-21Quickly reviewed last lecture. Introduced space complexity. Defined SPACE(f(n)), NSPACE(f(n)) , PSPACE, and NPSPACE. Proved that TQBF is in PSPACE; LADDER for DFA is in NSPACE(n); and LADDER for DFA is in SPACE(n^2).License: Creative Commons BY-NC-SAMore information at https://ocw.mit.edu/termsMore courses at https://ocw.mit.eduSupport OCW at http://ow.ly/a1If50zVRlQWe encourage constructive comments and discussion on OCW’s YouTube and other social media channels. Personal attacks, hate speech, trolling, and inappropriate comments are not allowed and may be removed. More details at https://ocw.mit.edu/comments. Learn more about your ad choices. Visit megaphone.fm/adchoices
Learn more about your ad choices. Visit megaphone.fm/adchoices
Więcej odcinków z kanału "MIT OpenCourseWare: Free Courses from the institute"



Nie przegap odcinka z kanału “MIT OpenCourseWare: Free Courses from the institute”! Subskrybuj bezpłatnie w aplikacji GetPodcast.








