Lex Fridman Podcast
#447 – Cursor Team: Future of Programming with AI
Aman Sanger
My intuition would just say, yeah, it should be. This is kind of going back to like if you if you believe p does not equal np then there's this massive class of problems that are much much easier to verify given a proof than actually proving it i wonder if the same thing will prove p not equal to np or p equal to np that would be that would be really cool
0
💬
0
Comments
Log in to comment.
There are no comments yet.