Introduction: Examples Tasks, Phases of AI & Course Plan

[@aakashgupta50]

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

[@CharlesXavier007]

thank ou brother means a lott

[@SameerSk]

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

[@takshpatel8109]

👌👌👌👌

[@dreadpirateroberts94]

To start from here

[@ujjwalsinghchauhan3831]

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.

[@tamilarasang4164]

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