Тёмный

Halting Problem - Blank Tape Problem - Reducibility - Decidability 

oaklandcse
Подписаться 852
Просмотров 19 тыс.
50% 1

How to reduce the halting problem to the blank tape problem

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

 

17 апр 2012

Поделиться:

Ссылка:

Скачать:

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

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 27   
@WildlyStapled
@WildlyStapled 10 лет назад
Thanks for showing this with a whiteboard and diagrams. My professor did nothing but scribble a few sentences on the board and talk for an hour. You're a prime example of youtube being a better source for education than my actual university.
@sohailshaikh786
I have been struggling with this halting problem, and now it makes sense a bit. Thanks
@Landowns
@Landowns 9 лет назад
♫ 'Cause I've got a blank tape baby....and I'll write your word ♫
@adityaupalkar007
@adityaupalkar007 Год назад
RU-vid Professors >>> GOAT!
@mariav1234
@mariav1234 6 лет назад
This helped me! Thanks.
@someonesomewhere8658
@someonesomewhere8658 4 года назад
Great explanation, great Professor.
@jtaoufiq
@jtaoufiq 3 года назад
Thank you very much. Very clear explanation.
@wooprime3482
@wooprime3482 3 года назад
Thank you!
@sericsheon2057
@sericsheon2057 3 года назад
8 years later .....this helped me Soo much
@bhubryan596
@bhubryan596 11 лет назад
i have never seen described with picture...surely helps a lot, thank you
@dhanushsivajaya1356
@dhanushsivajaya1356 3 года назад
Thankyou sir
@SamuelEvans1991
@SamuelEvans1991 10 лет назад
This is very well done, thank you
@user-yl5ky7vc8s
@user-yl5ky7vc8s 10 лет назад
謝謝!很清楚
@scottchen2094
@scottchen2094 7 лет назад
Can someone please explain to me why it's necessary to write a w on the tape?
@treaps
@treaps 9 лет назад
I believe your construction is probably good supporting material for why the undecidable/looping bit appears for the constructed machine, but your argument for that isn't clear to me. You also haven't clearly described why the constructed machine and the blank tape machine have output/decidability equivalence.
@claudio_sa
@claudio_sa 10 лет назад
It is clear ....
@AloysiusKnight
@AloysiusKnight 10 лет назад
As a visual person, this is the greatest thing ever
@kazikmajster5650
@kazikmajster5650 Год назад
3:30
@dx6nxr
chat, is this real?
@BerkayCelik
@BerkayCelik 8 лет назад
Are these two statements same: 1) Reducing the blank tape problem to halting problem 2) Reducing the halting problem to blank tape problem?
Далее
Reduction
32:38
Просмотров 12 тыс.
ВОТ ЧТО МЫ КУПИЛИ НА ALIEXPRESS
09:35
Emptiness for Turing Machines is Undecidable
9:00
Просмотров 17 тыс.
24 mapping reductions
53:28
Просмотров 2,7 тыс.
Turing & The Halting Problem - Computerphile
6:14
Просмотров 851 тыс.
Undecidability of the Halting Problem
8:00
Просмотров 252 тыс.
Lecture 41/65: Halting Problem: A Proof by Reduction
10:21
Understanding the Halting Problem
6:33
Просмотров 78 тыс.
Impossible Programs (The Halting Problem)
6:50
Просмотров 158 тыс.
Decidability and Undecidability
7:42
Просмотров 479 тыс.