Sean Carroll's Mindscape: Science, Society, Philosophy, Culture, Arts, and Ideas
AMA | September 2024
Sean Carroll
So there actually is a consistent story, I think, that you can tell. Chris is still writing his paper, so forgive me if there's elaborations to come on that view. Eugene says computer scientists mostly assume that p is not equal to np, which means that there's a variety of problems for which exponential time is required to compute answers on a Turing machine.
0
💬
0
Comments
Log in to comment.
There are no comments yet.