MIT 18.404J Theory of Computation, Fall 2020
Instructor: Michael Sipser
View the complete course: ocw.mit.edu/18-404JF20
KZitem Playlist: • MIT 18.404J Theory of ...
Quickly reviewed last lecture. Showed that natural numbers and real numbers are not the same size to introduce the diagonalization method and used it to prove acceptance problem for TMs is undecidable. Introduced the reducibility method to show that HALT for TMs is undecidable.
License: Creative Commons BY-NC-SA
More information at ocw.mit.edu/terms
More courses at ocw.mit.edu
Support OCW at ow.ly/a1If50zVRlQ
We encourage constructive comments and discussion on OCW’s KZitem and other social media channels. Personal attacks, hate speech, trolling, and inappropriate comments are not allowed and may be removed. More details at ocw.mit.edu/comments.
Негізгі бет 8. Undecidability
Пікірлер: 25