Content deleted Content added
→Bit complexity and asymptotic complexity: several changes done |
Duckmather (talk | contribs) rate as mid for math |
||
(10 intermediate revisions by 7 users not shown) | |||
Line 1:
{{Skip to talk}}
{{Talk header}}
{{WikiProject Computer science|class=c|importance=Top}}▼
{{WikiProject Systems|class=c|importance=mid}}▼
{{WikiProject Computing|class=c|importance=Mid}}}}▼
▲{{ArticleHistory|action1=RBP
|action1date=12:29, 19 January 2004
|action1link=Wikipedia:Archive/Refreshing brilliant prose - Science
Line 26 ⟶ 20:
|currentstatus=FFA
}}
{{WikiProject banner shell|class=B|vital=yes|1=
{{
}}
==older entries==
Line 51 ⟶ 49:
*Support removal. The weird thing is that I don't even see this article on [[Wikipedia:Featured article candidates/Featured log]]. When the WP:FA page was new, a lot of people added articles themselves, as the candidate process was kind of unclear. - [[User:DropDeadGorgias|DropDeadGorgias]] [[User_talk:DropDeadGorgias|(talk)]] 17:02, Jul 26, 2004 (UTC)
* Support removal; this is nowhere near comprehensive. [[User:Matt Crypto|— Matt]] 17:32, 27 Jul 2004 (UTC)
* Remove posthaste. The "notable researchers" section is particularly disturbing; you can hardly do such a list justice, certainly not with only a dozen names. [[User:Sj|+sj]][[User Talk:Sj|<
=="Invitation" to work on questionable off-topic article==
Line 469 ⟶ 467:
== Supertasks ==
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, [[User:Orange Suede Sofa|<span style="font-variant:small-caps
== Computational complexity ==
|