Timeline for Complexity of computing the antiderivative of a given function
Current License: CC BY-SA 3.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Dec 26, 2017 at 9:55 | history | suggested | Rodrigo de Azevedo | CC BY-SA 3.0 |
Minor improvements
|
| Dec 25, 2017 at 15:36 | comment | added | user56834 | @yuvalFilmus, do you mean I was disrespectful? I'm sorry, that wasn't my intention. | |
| Dec 25, 2017 at 15:10 | history | tweeted | twitter.com/StackCompSci/status/945310770639843328 | ||
| Dec 25, 2017 at 15:01 | answer | added | Yuval Filmus | timeline score: 3 | |
| Dec 25, 2017 at 14:56 | comment | added | Yuval Filmus | You won't get far with this attitude. | |
| Dec 25, 2017 at 14:43 | comment | added | user56834 | @YuvalFilmus, Why are you forcing me, a complete amateur, to choose a model of computation? My decision can only be random or ill informed. Doesn't it make a lot more sense for someone like yourself to choose the model based on what makes sense? I don't even know exactly what it means to choose a model of computation. I am just wondering whether, roughly, "all integrals of tractable functions are tractable". | |
| Dec 25, 2017 at 14:21 | comment | added | Yuval Filmus | The expression $\int f(x) \, dx$ only makes sense if $f$ accepts real numbers as input. Accordingly, you have to use some model of real computation (i.e., computation on real numbers). There are several such models, and you have to choose one (see for example cs.stackexchange.com/a/29671/683). Which one do you choose? | |
| Dec 25, 2017 at 9:50 | comment | added | Rodrigo de Azevedo | If $f$ polynomial? What error function are you using? | |
| Dec 25, 2017 at 9:48 | review | Suggested edits | |||
| S Dec 26, 2017 at 9:55 | |||||
| Dec 25, 2017 at 9:24 | comment | added | Complexity | Is your model of computation RAM? | |
| Dec 25, 2017 at 9:17 | comment | added | user56834 | @fade2black, yes I think thats what I mean, but since maybe sometkmes the integral cannot be computed (i dont know if thats true) lets say we require it to be computed within error $\epsilon$ | |
| Dec 25, 2017 at 8:00 | comment | added | fade2black | What do you mean by "the computational complexity of a function"? Is it complexity of an algorithm that computes the function $f(x)$? | |
| Dec 25, 2017 at 7:45 | history | asked | user56834 | CC BY-SA 3.0 |