Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
tshaddox
on July 11, 2014
|
parent
|
context
|
favorite
| on:
File system that stores location of file in Pi
I bet I could take a few moments and come up with a proof that such a method would require P=NP.
dtech
on July 11, 2014
[–]
I can't find an authoritative source on this, but the algorithm used by SuperPi:
https://en.wikipedia.org/wiki/Gauss%E2%80%93Legendre_algorit...
seem polynomial in the number of digits you want to calculate at first glance.
tshaddox
on July 11, 2014
|
parent
[–]
Even if that's the case, wouldn't the number of digits of pi that must be computed to find a n occurrence of a random bit string of length n not be polynomial in n?
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
