Talk:Computational complexity theory: Difference between revisions

Content deleted Content added
Line 168:
::I think what I wrote is accurate, and definitely more correct than speaking of efficiency of algorithms, but it can always be improved, of course. [[User:Scottcraig|Scottcraig]] ([[User talk:Scottcraig|talk]]) 21:05, 14 January 2008 (UTC)
:::What I'm "getting at" is that complexity is a theoretical limit, whereas scalability is a practical metric. They're similar but not identical concepts, and shouldn't be treated as if they were the same thing. Servers have scalability, but algorithms have complexity. Complexity describes a rate of increase in resource consumption, whereas scalability describes a system's capacity to cope with that increase. I appreciate your interest in the topic, but I don't think your rewrite takes the right approach, and if and when I have some spare time, I'm going to take a crack at editing this article myself. [[User:Groupthink|Groupthink]] ([[User talk:Groupthink|talk]]) 21:57, 14 January 2008 (UTC)
 
:::The old definition explained what complexity was; the new def replaces it with another term, scalability. I don't find that more helpful. I also believe it is not the terminology used in the field, where efficiency is generally used and defined mathematically. So I am restoring the old def.--[[User:ArnoldReinhold|agr]] ([[User talk:ArnoldReinhold|talk]]) 22:01, 14 January 2008 (UTC)