Відео

Lf is basically how to define a set, for which the output is "yes".

Sire, any book recommendation to along this playlist ?

Wouldn't a set of non-result altering transformations which result in True be a verifiable certificate for the Tautology problem? Thanks for the well articulated video.

Who is here in August, 2024. I am.

can you pls proved the pdfs of your notes? they would be really helpful for revising the concepts

thank you very much... this was really helpful :) would be great if you could provide the pdfs of your handwritten notes

The first proof seems to be easier to come up with

Hello @compscilessons Great work you are doing on this channel. I have a favour to ask of you. I have a paper on computational complexity, more specifically on SAT solving and would like a peer review. Unfortunately, I am unaffiliated with any institutions. Can you give me an endorsement on the preprint server arXiv so that I can make a submission or provide an email address where I can share my paper with you? Any assistance on this is appreciated. Thanks.

Really helpful thanks!

Thank you

Why is the g in the definition of a reduction taking in both of x and y?

Very clear explanation - Thanks! One Question: What would we do, if we insist, that the numbers given as instance for the SUBST SUM problem are different to each other?

No other video explains the pricing method on weighted vertex covers as well as yours, thank you so much, great video

You are genuinely awesome.

you are single handedly saving my ass. may your soul be blessed

Anyway, thank you. This video helped me a lot 🎉

Can you please do the colonel Blotto game

you did good job but my stoopid self could not understand it.

Why is that true? What about a clause of the form: x and ~y? It is not satistied when x and y are true and not satisfied when x and y are false.

you really don't explain things well

This was a very helpful explanation. The part after 13:00 was especially helpful explaining the purpose of the additional rows

Your channel is the best theoretical CS channel I've seen, fantastic job! thank you!

when you wrote down that proof idea at 2:30 my mouth started watering lets see where this goes

this module is so so good

Thank You!!

Thanks!

thank you so so so so much!!! you explain everything so clearly!!!!

i am going to now define the concept of mebeingfkingright. this foundational principle, now called mebeingfkingright, will be proven in the following way. i propose a machine, called the RightMachine that lays out a sequence of adjacent symbols. in each symbol is encoded the final position of the symbol to the left of itself or non at all. the machine beingfkingright at r0 and ends at r-finished. any sequence that this machine can lay down is said to be mebeingfkingright. therefore mebeingfkingright is any seqquence of symbols of mebeingfkingright that the RightMachine can process i.e. can go from r0-r-finish. tada the same level of proof as computability in this turing complete nonsense. the entire field of computer science folks.. like seriously without information theory and linguistics, computer science would just be a joke based on the inane crackpot nonsense of two guys during ww2.

Sir, you are doing God's work

Teacher, time 1:01, you write a f:{0,1}*: What does asterisk (*) mean?

Yup im bout to fail my exam lol

Was the question "What is Computation?" ever directly answered? Is a computation one run of a Turing machine from q_start to q_end? But even that doesn't answer the question, it only provides an example of a computation which is different than defining it.

Thank you!

Can u exaplian why (0,0,1) true but (0,1,0) false , plz i need u ?

oh wow, thanks! big fan of this thesis! it does seem like we'll get computer simulations that you can't distinguish from reality one day!

Amazing work!

If K = 3 or generally > 2, can you still find a solution in polynomial time?

thank you ,do you have the code of the The List Scheduling Algorithm? if you have,can you share with me please.

This course is pure gold. Many thanks for your time and effort man

Really nice course, I watched it with interest and joy.

really well explained, thank you!

Hervorragend!

thanks, saving my grade fr <3

It’s been enjoyable journey into the Complexity theory. Thank you Matthias

best video out there for planar and graph color

simply amazing, your explanations are phenomenal

Amazing tutorial! Explained the concepts behind LH algorithms brilliantly

life saver

Why can't x1 and ~x2 both be green? Or red?

Could you please explain why is there is a condition on T(n) >= n for all n in N in the second case for k-tape example?