3 ms·
> will this help up us to invent such algorithms? In addition to the obvious polynomial reduction between NP problems - which is usually not very practical - i
by einpoklum 7y ago
> will this help up us to invent such algorithms?
In addition to the obvious polynomial reduction between NP problems - which is usually not very practical - it is quite possible that this will help.
> I don't see how
“When I was a child, I spake as a child, I understood as a child, I thought as a child: but when I became a man, I put away childish things. For now we see through a glass, darkly; but then face to face: now I know in part; but then shall I know even as also I am known.” -1 Corinthians 13:11,12
- ggggtez 7y agoDon't respond to a question with a vague quote, if you want to talk about putting away childish things. If anything, it implies you don't actually know the answer either.
- jakear 7y agoThe point of the quote is to say that they don't know the answer either. So, yes. Think of it as: we are all children when it comes to the ramifications of the proof of P vs NP. We do not know the impact; we cannot know the impact. We will know it when it arrives.