Timeline for Help on clarification of a formal statement concerning algorithms running time
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 28, 2011 at 10:31 | comment | added | Carlo Kuip | See this link for the explanation of the Infinite Limit en.wikibooks.org/wiki/Calculus/Infinite_Limits | |
| Oct 25, 2011 at 4:21 | comment | added | user10326 | I forgive him :-) | |
| Oct 25, 2011 at 3:38 | comment | added | Job | The author got his PhD in CS around the same time you were born. Please forgive him for not being very good at imagining what it is like to not know any math or computer science. I bet he learned calculus before high school. Calculus is all you need here. | |
| Oct 24, 2011 at 19:23 | comment | added | user10326 | Yes.I was meaning that the way it is phrased is very formal | |
| Oct 24, 2011 at 16:30 | comment | added | David Thornley | That isn't really a formal statement; a formal statement would be essentially big-O notation, with or without the usual notation. | |
| Oct 24, 2011 at 16:09 | history | edited | user10326 | CC BY-SA 3.0 |
added 179 characters in body
|
| Oct 24, 2011 at 16:08 | answer | added | DeadMG | timeline score: 0 | |
| Oct 24, 2011 at 16:05 | answer | added | JB King | timeline score: 1 | |
| Oct 24, 2011 at 15:55 | history | asked | user10326 | CC BY-SA 3.0 |