Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
Ramfjord
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
6 ms
·
1.
▲
by
Ramfjord
16y ago
P is a strict subset of NP. If you can solve the problem in polynomial time, then you can verify a solution simply by generating it.
2.
▲
by
Ramfjord
16y ago
I believe there's some problem with assuming that, given an envelope containing X dollars, that the other envelope has a 50% chance of containing 2x, and a 50% chance of containing X/2. This step is clearly what leads us into the paradox.