Пікірлер

• 
  @LinhHoang-oi1bs3 күн бұрын

  love your animation!!!!!

• 
  @dark6.6E-344 күн бұрын

  I read the title as the hailing problem and thought the figure was Hitler -_-

• 
  @aashitanarayanpur86025 күн бұрын

  Great work, thank you!

• 
  @debasishkar7616 күн бұрын

  what is the input used for transition from q0 to q4 ?

• 
  @lazyonigiri56656 күн бұрын

  back after my exam grades, got full mark on this,, thank you

• 
  @Zx-Chatgarou7 күн бұрын

  How do we proove smth is reduce-able?

• 
  @onurrrrr7711 күн бұрын

  Hey Lydia! You helped me immensely in grasping Automata, are you planning on including complexity? I would also love seeing videos on another topics.

• 
  @pomegranate859311 күн бұрын

  thank you lydia!

• 
  @phenex181814 күн бұрын

  girl you saved my life <3 !!!

• 
  @samueldeandrade853514 күн бұрын

  I didn't know Logic could be this fun! Hehehehe. Loved it.

• 
  @aavashkuikel134116 күн бұрын

  Awesome explanation. Short and concise! Love from Louisiana, USA.

• 
  @aster440517 күн бұрын

  how to determine what length p to use?

• 
  @baltakatei18 күн бұрын

  The solution is for D's memory to be hit with a cosmic ray, flipping the contradicting bit. =P

• 
  @ChampDJ_1018 күн бұрын

  Basically it's a paradox...right?

• 
  @jam-burger21 күн бұрын

  The cutest way of learning Computation Theory😇

• 
  @kopanhagen66821 күн бұрын

  It's so brilliantly explained, it really makes you think-why didn’t I get this sooner?

• 
  @tahamian482222 күн бұрын

  I love your video! Please keep it up!

• 
  @user-qd8pi6hr6y24 күн бұрын

  where is video about regular expressions?!

• 
  @samuelchristophervisarra783024 күн бұрын

  i luve u

• 
  @aryaabhishek274324 күн бұрын

  the dfa doesn't accept 1110100 but i think it's in the language.

• 
  @AntoinetteMarieTorres25 күн бұрын

  please make more videos youre saving my grade

• 
  @FishSticker26 күн бұрын

  If the program D had to include the program A, wouldn’t this infinite recursion lead to an infinite program?

• 
  @trumpet_boooi23 күн бұрын

  meaning program H must have said both answers

• 
  @klazouski26 күн бұрын

  Alan Turing: it's impossible to create a program that would determine whether another program halts Me: okay. That interviewer at FAANG: write a program that would determine whether another program halts, otherwise we won't hire you

• 
  @MultiDragola26 күн бұрын

  I wish you made more videos i went through them all in preparation for my 2nd midterm

• 
  @markfaiziuni27 күн бұрын

  Wow this video is amazing!!! very helpful to understand DFAs! thank you so much!

• 
  @grimreaper7854Ай бұрын

  limx->∞(tree(x)) probably can't be brute forced with ∞ memory and ∞ computation power.

• 
  @aliramazani906Ай бұрын

  Hi Lydia, thanks for the amazing videos. I was wondering if you could also explain context free languages and how to use pumping lemma for them. Thanks 🙏

• 
  @Ai-gh8xqАй бұрын

  hey, these videos are GREAT<3 honestly i wish more people taught university students like this T-T. ik that making these videos take a lot of effort, but i hope you come back with more! These videos can really gain momentum, and even if they somehow dont, ik atleast i would be psyched up for your return!

• 
  @TechWithAbeeАй бұрын

  0:18 is crazy

• 
  @Antonio9648Ай бұрын

  Great explanation

• 
  @TechWithAbeeАй бұрын

  cool

• 
  @saikoushik4064Ай бұрын

  Easiest and Cute explanation

• 
  @hostelprofessional573Ай бұрын

  These are really great videos. This young lady has a gift.

• 
  @pauljanetschek6520Ай бұрын

  Great vid but the audio is very very quiet

• 
  @TRoss-ru6sgАй бұрын

  This is so good

• 
  @SirYennerАй бұрын

  H is only wrong because it's inside D. Give D's program directly to H by itself.

• 
  @TheCsTutor-qk3uyАй бұрын

  but I want a dragon :(

• 
  @TRoss-ru6sgАй бұрын

  Beautiful

• 
  @DachiZedginidze-ds8kuАй бұрын

  I think there might be a small issue in transition function. q1 transitions to q0 if 0.

• 
  @JeremiahChellaАй бұрын

  Thank you for your videos

• 
  @nopaallo1147Ай бұрын

  she made me understand the concept of pumping lemma in 1:11 minutes, a concept that i couldn't grasp from the lectures 💀

• 
  @sutischolarАй бұрын

  I wish I had a lot of money as a student, so I could give a lot of it to you

• 
  @zarawzn61122 ай бұрын

  Thank you for this explanation ! I really understood this concept. I was very scared of it but know I get it. Still I have a small question: When you were writing the sigma (I don't have the symbol lol), you said for q1 , if it's 1 then the state is q2 (here it's alright) and for 0 then the state is q1 ( isn't it q0 ?!) why is it q1 ?

• 
  @orangjoystick1232 ай бұрын

  I like your voice, very fluent

• 
  @atharvaswami57262 ай бұрын

  girl made a playlist on TOC and then just vanished.

• 
  @m.usmankhalil84712 ай бұрын

  this is just so good

• 
  @user-qp1tm5jw2t2 ай бұрын

  I like❤this halting problem ,thanks🌹🙏❤ for creating this video 🎥 I enjoyed😊😂and cartoons are so cute I like it ❤. And getting halting problem knowledge📚 very easily. Thank you❤.......

• 
  @cxrxmeluxe2 ай бұрын

  Earlier today i had no idea what my lecturer was explaining and felt like it was a complex concept but your video really lit a bulb in my head. Thank you 🫡

• 
  @jaypople88852 ай бұрын

  You are Saviour

• 
  @afonsosantos14162 ай бұрын

  You're litteraly saving me on Computing Theory