Timestamps: 0:00 - Intro 7:43 - Start of topics 8:18 - Review/Motivation for a new model 12:13 - Definition of a TM 27:26 - Example of a TM 37:47 - What is a configuration, a computation and few more terms. 45:18 - Decidable language 47:18 - TM Variants (includes Professors "Stay-Put" machine) 1:00:24 - Taking A Short Break. . . 1:06:10 - More TM Variants (Multi-tape TM, Non deterministic TM) 1:26:20 - Computation tree 1:34:25 - Can TMs do arithmetic? 1:41:15 - Church-Turing Thesis 1:44:09 - Problems for TMs ("High-level" algorithm/Encodings) 1:52:24 - Taking A Short Break. . . 1:58:49 - Decidable problems involving DFA, NFA, REGEX. . . 2:13:42 - "Emptiness" Problem 2:19:15 - "Equivalence" Problem 2:28:46 - "Acceptance" Problem (for context-free grammars) 2:39:14 - "Emptiness" Problem for CFG 2:48:50 - End
Quality is easily 10/10. Thank you for making such great education accessible. There's great education on UA-cam, but there's also quite a bit of low quality educational content.
did you do a full video on undecidabiilty or just a bunch of short ones. I saw several shorter videos but was wondering if there was a single comprehensive video that i am missing.
Timestamps:
0:00 - Intro
7:43 - Start of topics
8:18 - Review/Motivation for a new model
12:13 - Definition of a TM
27:26 - Example of a TM
37:47 - What is a configuration, a computation and few more terms.
45:18 - Decidable language
47:18 - TM Variants (includes Professors "Stay-Put" machine)
1:00:24 - Taking A Short Break. . .
1:06:10 - More TM Variants (Multi-tape TM, Non deterministic TM)
1:26:20 - Computation tree
1:34:25 - Can TMs do arithmetic?
1:41:15 - Church-Turing Thesis
1:44:09 - Problems for TMs ("High-level" algorithm/Encodings)
1:52:24 - Taking A Short Break. . .
1:58:49 - Decidable problems involving DFA, NFA, REGEX. . .
2:13:42 - "Emptiness" Problem
2:19:15 - "Equivalence" Problem
2:28:46 - "Acceptance" Problem (for context-free grammars)
2:39:14 - "Emptiness" Problem for CFG
2:48:50 - End
Prof you are a true legend...
Quality is easily 10/10. Thank you for making such great education accessible. There's great education on UA-cam, but there's also quite a bit of low quality educational content.
Thanks prof LITERALLY saving my semester
For the TM shown at 30:47 is the the function that it computes: 0^n -> {x^(n-1) : n is even}
you are gonna save my exam, thank you sir!
you're literally an angel
People outside CS major watch games/makeup/miscellaneous livestream.
CS major students watch theory-proof livestream.
Lol
very good effort thank you
understood what 1-2 months of university lectures failed to teach me
@@kl191 so true
did you do a full video on undecidabiilty or just a bunch of short ones. I saw several shorter videos but was wondering if there was a single comprehensive video that i am missing.
Nice video :). I love you
You are the best!
thank you buddy, can I just say you look like duncan robinson :)
and you look like gollum
Thankyou
If Turing Machine variants are equivalent in power to regular Turing Machines, why would you create or use a Turing Machine variant?
Easier representation I think is the big thing. In practice, performance is also a consideration depending on the variant
Is it necessary that the tape is one way infinite? can't it be two way infinite?
Yes, you can simulate a two-way infinite tape with a one-way one (think about how it would work)
This is super helpful! Is there a way to donate in cryptocurrency?
You're very welcome! And no, I don't have any ways of donation like that.
Thank youuuu so helpful, may Allah bless you with Islaam