The Church-Turing Thesis
Вставка
- Опубліковано 15 жов 2024
- 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
Contribute: www.nesoacademy...
Website ► www.nesoacademy...
Forum ► forum.nesoacade...
Facebook ► goo.gl/Nt0PmB
Twitter ► / nesoacademy
Pinterest ► / nesoacademy
Music:
Axol x Alex Skrindo - You [NCS Release]
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
took me one night and i hope i pass the exams .... thanks Neso
not 1 or 2 month i used to complete before one night of my college exam 🤗🤗
@@sauravkumar-gl8wgdid you pass
I have 2 days to complete it
@@myself5812prob not
This channel requires a standing ovation.
1000%
instablaster...
no
yeah and spooning
You're the reason why I fell in love with the theory of computation, thank you for all your hard work making these videos
Thnq so much sir, आपकी वजह से sub easy होगया और intrest पर भी, #love from maharashtra
Me too complete gratitude, i guess that's what Indians do , they teach be it spirituality or theoretical knowledge
I can't imagine what the people in 2016 and earlier had to go through without this channel
Exactly right , it saves so much time
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!!!
this channel deserves a lot more recognition
I started loving the Theory of computation because of this channel
i dont
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.
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.
Your explanations are really simple to understand thanks for such a great course.
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 .
no you cant
Why in your Venn Diagram there is no Context Sensitive Language sir? And also your playlist doesn't have this topic sir😢
Can aktu students study from here
your english as well as concept is so easy to understand
its hard to understand
I expected to hear more about Church-Turing Thesis, ECTT, Physical ECTT...
Bhai konsa nasha krke aya hai... Church thesis chor ke sab bata diya
nice work!
Sorry its bugging me: Alan Turing not Alen Turing
Thanks for the very nice videos on a complicated topic. The name of Turing is spelt wrong. The orrect name is Alan Turing.
no its not
The Imitation game.
Good movie
Puri playlist kr k bhi dar lagra h ajj exam k liye
Thanks Neso 😊😊👍
Hey, your videos are really great. Will you be adding further lectures on undecidable problems?
please upload videos on undecidability
Niraj Singh it's already been uploaded. Look it up. It's good
@@parthapratimgoswami7195 theres no video
thanks...nice lectures...
thank you very much
Welcome back!!! 👍
It's amazing
*Alan Turing :).
What about cFL and regular language? Whether they halt or not
Turing Recognizable (Recursively Enumerable) languages are not decidable, in the sense that if you take any string from a language L, and feed this string as input to the Turing Machine, then the TM will be able to know if this string belongs to the language (this is equivalent to saying that it will halt and return YES or accept the string as input), however if you take any string that doesn't belong to the language and feed it to the TM, then the TM will not be able to say that the string doesn't belong to the language (this is equivalent to saying that it may or may not be able to show that it belongs. In most cases it doesn't give an answer). Hence Recognizable; halt or not halt.
I was thinking the same thing, so I guess that's why the instructor gave that diagram by marking both Turing Recognizable and All languages as undecidable (it is because TM cant say if they don't belong to a language).
Watch the imitation game for allen turing. Its his biography.
no its not
His name isn't Allen Turing. It's Alan Turing.
right wtf.
its allen
@@tszkoon4269 You are braindead.
quite impressive
actually VERY impressive
02:00 just look at their birth and death years 💀💀
no
I was exactly born 47 years after Allen Turing dies.
think you from algeria
#Excelent!
f de,
Very first your video, Allen is wrong. Please change to Alan and show some respect.
how is writing someone name mistakenly wrong related to disrespecting someone.. you don't even know the true meaning of respect.. It's his work which makes him respectable.