Wikipedia:Featured article review/Computational complexity theory: Difference between revisions
Content deleted Content added
No edit summary |
MalnadachBot (talk | contribs) m Fixed Lint errors. (Task 12) |
||
(2 intermediate revisions by 2 users not shown) | |||
Line 1:
===[[Computational complexity theory]]===
:''Article is [[WP:FFA|no longer a
How on Earth did this get featured? No mention of models of computation. No mention of Turing machines! No explanation of non-determinism. Nothing about randomized algorithms. Nothing about parallel computation and the structure of P. Nothing about reduction. No pictures. No history. [[User:Gdr|Gdr]] 08:40, 2004 Jul 26 (UTC)
*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|<
|