Introduction: Examples Tasks, Phases of AI & Course Plan

แชร์
ฝัง
  • เผยแพร่เมื่อ 2 ม.ค. 2025

ความคิดเห็น • 7

  • @aakashgupta50
    @aakashgupta50 3 ปีที่แล้ว +19

    P is set of problems that can be solved by a deterministic Turing machine in Polynomial time.
    NP is set of decision problems that can be solved by a Non-deterministic Turing Machine in Polynomial time. P is subset of NP (any problem that can be solved by deterministic machine in polynomial time can also be solved by non-deterministic machine in polynomial time).
    Informally, NP is set of decision problems which can be solved by a polynomial time via a “Lucky Algorithm”, a magical algorithm that always makes a right guess among the given set of choices

  • @SameerSk
    @SameerSk 4 ปีที่แล้ว +6

    I love this course but the exam fee is a bit expensive so as to enroll for the exam.

  • @takshpatel8109
    @takshpatel8109 2 ปีที่แล้ว

    👌👌👌👌

  • @ujjwalsinghchauhan3831
    @ujjwalsinghchauhan3831 4 ปีที่แล้ว +5

    To be honest defining what is AI ? is somewhere a lot more difficult than to form a definition based on just some specific knowledge humans have! Why? Cuz if we ever could build a machine which is just like a clone of Human(in all aspects) then we could only define AI in the way it should have defined then.

  • @dreadpirateroberts94
    @dreadpirateroberts94 2 ปีที่แล้ว

    To start from here

  • @tamilarasang4164
    @tamilarasang4164 7 หลายเดือนก่อน

    ,.?, mjm, mjk ll l o kisi😅