Timeline for What does it mean to be "independent of machine model"?
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 20, 2015 at 21:07 | comment | added | vzn | (sigh) its meant as a near-popsci explanation, suitably hedged, aimed at the layman, not from advanced complexity theory, where the answer is already known to those familiar with it, not against other answers but complementary to them... | |
| Nov 20, 2015 at 19:55 | comment | added | Yuval Filmus | This answer is misleading, since Turing machines can be polynomially smaller than RAM machines, for example. This is the advantage of $\mathsf{P}$ over linear or linearithmic time. | |
| Nov 20, 2015 at 18:04 | history | answered | vzn | CC BY-SA 3.0 |