Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

> it seems plenty possible that some group of problems have a lower bound that's polynomial and still big.

Yes, that is a definite fact: https://en.wikipedia.org/wiki/Time_hierarchy_theorem

10000000 isn't that big a number anyway. We may be up against horrendous numbers that are so large that there is no concise way to write them down, even with recursive formulas such as Ackermann's function, or that sort of thing.



Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: