Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on A proof P = NP was accidentally published in TOCT. Parent comment
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.
There are no comments on this comment yet.
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.