Тёмный

The Post Correspondence Problem 

Neso Academy
Подписаться 2,6 млн
Просмотров 328 тыс.
50% 1

TOC: The Post Correspondence Problem
Topics discussed:
1. The Post Correspondence Problem
2. Examples of The Post Correspondence Problem
3. Undecidability of The Post Correspondence Problem
Contribute: www.nesoacademy.org/donate
Website ► www.nesoacademy.org/
Forum ► forum.nesoacademy.org/
Facebook ► goo.gl/Nt0PmB
Twitter ► / nesoacademy
Pinterest ► / nesoacademy
Music:
Axol x Alex Skrindo - You [NCS Release]

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

 

6 фев 2018

Поделиться:

Ссылка:

Скачать:

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

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 42   
@Kaz.2719
@Kaz.2719 4 года назад
THANK YOU! I learned more in your 14 minute lecture than a 1 hour lecture by my professor :D
@emmanuelsherman3066
@emmanuelsherman3066 2 года назад
You’re a true legend in TOC. I will tell all of my friends to follow your lectures. You make problems explicit and solvable better than those I am paying to teach me at college. Thank you so much.
@bevivacious3921
@bevivacious3921 5 лет назад
thanks for such amazing videos.the videos helped me a lot in my learning.
@DenisG631
@DenisG631 6 лет назад
Thanks! It helped. So it's not decidable, but it is recognizable, right?
@jorgechavez5698
@jorgechavez5698 5 лет назад
You literally guaranteed me 25% on my final. Thanks!
@trywellwashington7506
@trywellwashington7506 4 года назад
The numerators are the input to the transfer functions, denoms are the outputs. Being able to cancel everything out means you're at the end state (from end state -> end state ~ means nowhere else to go). The hashes mean you're at the end of the input string?
@startercoder
@startercoder Год назад
amazing tutorial! understood everything! thank you
@vishalkumargvkg2161
@vishalkumargvkg2161 4 года назад
Thank you sir ... finally I understood pcp
@jackjill4418
@jackjill4418 2 года назад
Thanks a lot sir. Explanation is very clear.
@tanmayn1984
Thank you sir for this lecture , it surely benefitted me
@feikezhang3354
@feikezhang3354 5 лет назад
You really saved my life!
@rishiupadhyay3956
@rishiupadhyay3956 4 года назад
If I had studied it a couple of weeks before, I could've scored 2 more Marks in NET. Anyway, "girna nahi gir k samhalna hain zindegi"
@narendraparmar1631
@narendraparmar1631 4 года назад
Thanks a lot Neso Academy
@vishnumuralidhar5659
@vishnumuralidhar5659 Год назад
In the example 2 we have to use only domino 2 because 10111 and 10 but when I choose domino 1 mean 1 and 111 then there is no other go for 11 takes place.
@yogeshrawat5095
@yogeshrawat5095 5 лет назад
Very nice explanation sir !!
@Samuel-wl4fw
@Samuel-wl4fw 4 года назад
Thanks great video
@vedikaagarwal1859
@vedikaagarwal1859 3 года назад
Is it necessary to use all the dominos while coming to final PCP solution?
@chandrikakc1179
@chandrikakc1179 2 года назад
Nice explanation sir 🙌
@dhruvsharma5786
Dhanyawad Guruji ❤❤❤❤❤
@joesnotebook3524
Awesome, Understood thoroughly
Далее
Undecidability of the Post Correspondence Problem
27:46
Understanding the Halting Problem
6:33
Просмотров 78 тыс.
Multitape Turing Machine
17:33
Просмотров 303 тыс.
Undecidability of the Halting Problem
8:00
Просмотров 252 тыс.
Turing & The Halting Problem - Computerphile
6:14
Просмотров 851 тыс.
The Halting Problem
7:26
Просмотров 410 тыс.
Decidability and Undecidability
7:42
Просмотров 479 тыс.
The Halting Problem: The Unsolvable Problem
4:14
Просмотров 137 тыс.