Informatics Weekly, written by Mihai Pătraşcu.
The Fall 2011 New York Theory Day is happening this Friday, November 11th, at NYU (Courant), and features yours truly as a speaker.
I hope to see many of you there!
Hi Mihai, I am just wondering if there is any proof showing that the problem P=NP is decidable? I am just wondering if the P=NP has some relation with the Halting Problem (but honestly I am not sure and my background in theory is not yet that wide, so sorry if I have mistakes with my assumptions), I have not heard/seen/read anything concerning this. Maybe you can help on this. Thanks.
Post a Comment