Hacker News
points by spr-alex 2 days ago | 0 comments
The bounds where this subexponential claim kicks in is at n > 2^10^9. The information to describe such a large 3-SAT would not fit inside of a blackhole 10^1000 times the size of our whole universe. At this incredible scale, the philosophy of computational analysis might be open to loopholes that autogenerated / autoresearch is subtly exploiting instead.
Aún no hay comentarios.
Hacker News