Reducibility: A Technique for Proving Undecidability | Reduction | Reduction theorem

Поділитися
Вставка
  • Опубліковано 22 гру 2024

КОМЕНТАРІ •

  • @ajayraho
    @ajayraho 10 місяців тому +5

    No one taught me like this, Superb ! Great content!
    I COMMIT THAT I WILL GET GREAT IIT THIS YEAR AND I WILL DONATE A LOT!!!

  • @debdeeppaulchaudhuri9714
    @debdeeppaulchaudhuri9714 2 роки тому +5

    Great intuitive explanation on this topic, strong intuition always works best in exams like GATE! :)

  • @trojanhorse8278
    @trojanhorse8278 2 роки тому +2

    Such a beautiful explanation sir, so captivating till the very end of the lecture. Big thanks from all the student community.

  • @subhajitghosh3867
    @subhajitghosh3867 2 роки тому +4

    Gate 2022 my rank was 7235, if this year I will get good rank, I will definitely working with you as a TA. ❤

  • @sunny90908
    @sunny90908 Рік тому +1

    Discrete Logic helping to understand this more !

  • @mamtakumar7768
    @mamtakumar7768 2 роки тому +3

    I have no words

  • @_strangelet__
    @_strangelet__ Рік тому +3

    Hope that logic doesn't someday prove that building a machine functioning with intuition is an undecidable problem 😂