Timeline for Solving or approximating recurrence relations for sequences of numbers
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 13, 2013 at 9:42 | comment | added | Raphael | From my own experience, trying to use computer algebra without any sense of what is "hard" or "easy" does not get you very far. Especially in algorithm analysis, some massaging can be needed. I don't know how you do that without knowing how to solve recurrences yourself. (As for the purpose of this site, there are multiple point of views. Fact: so far, "this is useful for somebody" was not sufficient to justify a post.) | |
| Jul 11, 2013 at 10:02 | comment | added | Raphael | I do think that the purpose of this site would be to explain how computer algebra does things like this, not to advocate its blind use. But the tools are useful, so useful in fact that one should probably always try them before "wasting" time (in "practice"). | |
| Jul 10, 2013 at 23:20 | history | answered | D.W.♦ | CC BY-SA 3.0 |