Timeline for Examples of Super-polynomial time algorithmic/induction proofs?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 26, 2020 at 12:15 | comment | added | Emil Jeřábek | This is a much, much slower algorithm than the Ackermann function. And you can write down a rough estimate of the running time, you just need a suitable notation. It’s something like $f_{\epsilon_0}$ (see en.wikipedia.org/wiki/Fast-growing_hierarchy). | |
| S Dec 30, 2013 at 22:47 | review | Late answers | |||
| Dec 30, 2013 at 23:26 | |||||
| S Dec 30, 2013 at 22:47 | review | First posts | |||
| Dec 30, 2013 at 23:33 | |||||
| Dec 30, 2013 at 22:28 | history | answered | none | CC BY-SA 3.0 |