P=NP is a problem I always wonder about. Can an answer that can be verified in polynomial time also be solved in polynomial time? I do think, modeled correctly, NP problems can become P problems, but that is the trick. How to model an NP problem so that it becomes a P problem? Or, if this cannot be done, then demonstrate a proof of that. Show exactly why an NP problem can never be modeled as a P problem. Maybe this will never be solved, but certainly worth thinking about.