Content deleted Content added
Line 185:
:::::::::Let's please not fight. Neither of you is a troll and you're just having an honest disagreement about the best way to present the topic, and which terminology is appropriate. I think the valid point that Groupthink is making is that the specific term "scalability" isn't conventionally used in complexity literature to explain the concept, but that doesn't mean the concept doesn't apply. It doesn't help that the term "efficiency" is also used in a number of different ways. On the other hand, there is the valid point that people familiar with the IT concept of scalability may be confused or surprised at its use here - which may suggest that it's best to avoid ''both'' terms and just explain the concept in more detail. For example, "complexity studies the resource requirements needed to solve problems of different sizes", or something like that. [[User:Dcoetzee|Dcoetzee]] 17:52, 15 January 2008 (UTC)
== Bit complexity and asymptotic complexity==
''[[Bit complexity]]'' redirects to this article, but unfortunately the article does not explain what this means. What is it? Thank you. --[[User:Abdull|Abdull]] ([[User talk:Abdull|talk]]) 19:48, 24 July 2008 (UTC)
:Bit complexity refers to a measure of time complexity where the only operations assumed to operate in constant time are operations that act on single bits. I personally think it should be discussed in another article that compares and contrasts it with models where log-sized words are the unit. I'm not sure what such an article would be called. [[User:Dcoetzee|Dcoetzee]] 21:27, 24 July 2008 (UTC)
::Thank you for your answer. I'd be great if there was an article about the topic you mentioned (because, for example, I cannot imagine what a ''log-sized word unit'' is yet). In the meantime, I stumbled upon another redirect, ''[[asymptotic complexity]]'' which defies definition. --[[User:Abdull|Abdull]] ([[User talk:Abdull|talk]]) 09:02, 25 July 2008 (UTC)
| |||