The Church-Turing Thesis

preview_player
Показать описание
TOC: The Church-Turing Thesis
Topics discussed:
1) The Church-Turing Thesis
2) Variations of Turing Machine
3) Turing Machine and Turing TEST
4) The different classes of languages
5) Turing Decidable Languages
6) Turing Recognizable Languages

Music:
Axol x Alex Skrindo - You [NCS Release]
Рекомендации по теме
Комментарии
Автор

This channel requires a standing ovation.

sayakks
Автор

I can't imagine how time consuming learning TOC must have been before this channel existed, for what we can finish in 1-2 months with this playlist, must have taken people more than 4-5 months of intense 📚 books digging
You are a time saving, angle sir and you make toc so easy to understand

zackcarl
Автор

You're the reason why I fell in love with the theory of computation, thank you for all your hard work making these videos

andreicozma
Автор

I can't imagine what the people in 2016 and earlier had to go through without this channel

jideplumptre
Автор

First to comment. You have really reduced my burden immensely. I can't imagine how long it would have taken me to study solely with Hopcroft's book on Theory of computation. Thanks a million!!!

ridwannana-yawamoako
Автор

this channel deserves a lot more recognition

davidkk
Автор

i took me almost a whole day to read this topic from the book authored by peter linz, but still i was unable to understand it, thankyou for making it most easier, wish i had known about this channel before.

afshanahassan
Автор

I started loving the Theory of computation because of this channel

gunjankeshari
Автор

Your explanations are really simple to understand thanks for such a great course.

nedahsn
Автор

12:07 "whatever string you pass into the TM, it will never come to a halt" isnt that wrong? i thought undecidiable just means there exists at least one input s.t. it wont halt. so you can come up with one input that may halt, but if any other input doesn't halt, then its undecidiable.

RICHARDKOVARLIETZBTW-yegu
Автор

The tape head doesn't have to move .We can update the symbol .Consider the following : delta (q, 0) = (p, 1) .Here, tape head is not moving but we are writing 1 instead of 0 .

onursimsek
Автор

your english as well as concept is so easy to understand

JahidHasan-zlom
Автор

Bhai konsa nasha krke aya hai... Church thesis chor ke sab bata diya

rajjaiswal
Автор

Puri playlist kr k bhi dar lagra h ajj exam k liye

manavrawat
Автор

I expected to hear more about Church-Turing Thesis, ECTT, Physical ECTT...

nastyavicodin
Автор

please upload videos on undecidability

midpro
Автор

Hey, your videos are really great. Will you be adding further lectures on undecidable problems?

sai
Автор

Why in your Venn Diagram there is no Context Sensitive Language sir? And also your playlist doesn't have this topic sir😢

ursmile_makesmy_day
Автор

Thanks for the very nice videos on a complicated topic. The name of Turing is spelt wrong. The orrect name is Alan Turing.

ramesherrabolu
Автор

Sorry its bugging me: Alan Turing not Alen Turing

devilzwishbone