You might be interested in Scott Aaronson’s thoughts on this in section 4: Why Is Proving P != NP Difficult?, which is only 2 pages.
looks like you referenced the same paper before me while I was making my comment :)
Ha, that’s awesome. Thanks for including the screenshot in yours :) Scott’s “invisible fence” argument was the main one I thought of actually.
You might be interested in Scott Aaronson’s thoughts on this in section 4: Why Is Proving P != NP Difficult?, which is only 2 pages.
looks like you referenced the same paper before me while I was making my comment :)
Ha, that’s awesome. Thanks for including the screenshot in yours :) Scott’s “invisible fence” argument was the main one I thought of actually.