Тёмный

Lecture 40/65: Reducibility: A Technique for Proving Undecidability 

hhp3
Подписаться 24 тыс.
Просмотров 80 тыс.
50% 1

"Theory of Computation"; Portland State University: Prof. Harry Porter; www.cs.pdx/~harry

Опубликовано:

 

7 окт 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 24   
@yssun7679
@yssun7679 9 лет назад
Haha, the joke clarified the concept very well.
@jkklingelhofer
@jkklingelhofer 8 лет назад
Thank you so much for this video series! These concepts can be hard (for me at least) to grasp, but you do an excellent job of describing them.
@devanshsharma8543
@devanshsharma8543 4 месяца назад
you're so creative when it comes to examples !! Thanks !
@BenStuu
@BenStuu 5 лет назад
Great job explaining these concepts very simply! I appreciate the work you put into this video.
@bm-ub6zc
@bm-ub6zc 4 года назад
why is it that if the harder problem is unsolvable, it implies that the easier problem is unsolvable? because earlier you said that the harder problem was portland to cairo, which contains portland to new york to cairo. so if the plane from portland to new york is crashed, doesn't mean that the easier problem new york to cairo doesn't work.
@ethioaazazhmitiku3385
@ethioaazazhmitiku3385 2 года назад
This is the clearest explanation.thaks to gad
@jumana9999
@jumana9999 5 лет назад
The joke is hilarious xD Thank you for making those videos, i can learn in my own pace!
@serenali9911
@serenali9911 3 года назад
The best ever!!!
@laurenorsini1872
@laurenorsini1872 5 лет назад
Thank you! This is the clearest explanation I've found on youtube. Is there anywhere you upload PDFs of your notes? I'd love to have them to study with.
@Ilya_4276
@Ilya_4276 4 года назад
perfect explanation thanks a million times...
@ritaban23
@ritaban23 8 лет назад
I think u may have made a mistake in reductions. because we generally reduce a harder problem to its equivalent harder problem or more harder than that. If we get a solution to the harder problem ,we can use that solution to get the solution for the easier problem.
@hervediedie
@hervediedie 6 лет назад
Yes He did
@second_second_
@second_second_ 6 лет назад
now i'm confused.
@brucewayne7203
@brucewayne7203 5 лет назад
Thank you so much for this comment! You're right.
@ky8920
@ky8920 5 лет назад
he reduces a harder/undecidable to an (assuming) easier/decidable problem, and proof by contradiction that it is not the case.
@amaryllis.custtt
@amaryllis.custtt 8 лет назад
Thanks .excellent eplanation ,ever seen
@DheemanSaha
@DheemanSaha 3 года назад
I really liked your analogy
@guddusharma4696
@guddusharma4696 9 лет назад
good example
@amillion7582
@amillion7582 4 года назад
ok but before i do as the mathematician did, i need to know if he survived or not??
@SandhyaCs2101
@SandhyaCs2101 7 лет назад
beautifully explained :)
@JumanazarAmanow
@JumanazarAmanow Месяц назад
Isn't it just like, If I am watching this video then I am watching it?
@356379783
@356379783 8 лет назад
why do they go to the place again the second day, if they saw a bear the first day. haha
@deepakbhardwaj9543
@deepakbhardwaj9543 4 года назад
Because, if he weren't go then concept was not that much cleared!🤣
@Linaiz
@Linaiz 4 года назад
for science
Далее
Lecture 41/65: Halting Problem: A Proof by Reduction
10:21
Emptiness for Turing Machines is Undecidable
9:00
Просмотров 18 тыс.
Epic Reflex Game vs MrBeast Crew 🙈😱
00:32
Просмотров 8 млн
8. Undecidability
1:17:02
Просмотров 36 тыс.
16. Complexity: P, NP, NP-completeness, Reductions
1:25:25
Understanding the Halting Problem
6:33
Просмотров 82 тыс.
Lecture 32/65: Decidability and Decidable Problems
31:58
Turing & The Halting Problem - Computerphile
6:14
Просмотров 857 тыс.
NP-Complete Explained (Cook-Levin Theorem)
10:44
Просмотров 138 тыс.
Impossible Programs (The Halting Problem)
6:50
Просмотров 159 тыс.
The Halting Problem: The Unsolvable Problem
4:14
Просмотров 143 тыс.
Epic Reflex Game vs MrBeast Crew 🙈😱
00:32
Просмотров 8 млн