Church Turing Thesis | Church's Hypothesis | Theory of automata | TOC | LS Academy

[@amaanabdullah9965]

Best explanation

[@Hayat26474]

thanku sir !

[@deekshamishra5659]

Thanks sir 😊

[@harshsha0562]

Notes send krdijiye pls sir Exam h 2 se

[@-OmShinde]

Thanks sir

[@harshsha0562]

Sir iske Notes provide krdijiye pls unit wise

[@harshsha0562]

Sir krdijiye pls Exam h 2 se

[@47jatinsharma88]

But sir we can compute some of the PCP PROBLEMS . SO WE CAN COMPUTE PCP PROBLEMS ( SOME PROBLEMS NOT ALL ) BUT TURING MACHINE IS NOT POSSIBLE.

[@YuvrajSingh-sg6fu]

Yeah ,but there's not such an algo to solve the PCP problem ,we only use hit and trial method to solve PCP which is undecidable

[@47jatinsharma88]

@@YuvrajSingh-sg6fu so it means TM IS POSSIBLE FOR ALL COMPUTATIONAL PROBLEM . NOT ALL PROBLEMS .AM I CORRECT?

[@YuvrajSingh-sg6fu]

Exactly ,nd the problem is computed by some specific manner called algo as not by using hit and trial

[@musicworld3.0.]

Bhai log tum logo ka bhi kal toa ka paper h kya??

[@r.kkaushik4588]

Go to 1.5x after that, thanks to me