Content deleted Content added
→Supertasks: new section |
Question about statement in article. |
||
Line 463:
The [[supertask]] article has a note at the top stating "''For the computer science term, see [[Computational complexity theory]].''" Is that note accurate? Taken literally, it is not, as the term ''supertask'' cannot actually be found anywhere in this article. But I ask here because readers of this talk page may know if that characterization is somehow appropriate. Regards, <span style="font-variant:small-caps">[[User:Orange Suede Sofa|<font color="DarkGreen">Orange Suede Sofa</font>]]</span> ([[User talk:Orange Suede Sofa|talk]]) 07:11, 23 October 2012 (UTC)
== Computational complexity ==
[[Computational_complexity_theory#Upper_and_lower_bounds_on_the_complexity_of_problems|Upper_and_lower_bounds_on_the_complexity_of_problems]], begin with stating that "''one is interested in proving upper and lower bounds on the '''minimum''' amount of time required by the most efficient algorithm solving a given problem. The complexity of an algorithm is usually taken to be its worst-case complexity''" Shouldn't it be the maximum amount of time?--[[User:Natematic|Natematic]] ([[User talk:Natematic|talk]]) 17:55, 18 November 2012 (UTC)
| |||