6
$\begingroup$

update: since we now have moderators, should we close this thread, using separate threads for each discussion, or should we keep it, appropriately reworded ?

Update II: This question is now closed, since there are sufficiently many 500+rep users, and posts can also be flagged if needed.

I am opening this thread to capture questions that should be closed.

Only users with rep over 500 can close a question, which currently amounts to five users. This question should help draw attention to those questions for the top users. Will be necessary until more users have sufficient rep and/or moderators exist.

Edit: One thing that we did with this thread on stats.stackexchange.com, was to vote down resolved answers so that unresolved ones would bubble to the top and get more attention. I suggest that we start doing that here as well.

$\endgroup$
5
  • 4
    $\begingroup$ Well, this is sure awkward. $\endgroup$ Commented Aug 24, 2010 at 2:40
  • $\begingroup$ btw I've been voting to close questions since well before I've had 500 rep. There's also the option of using downvotes, which I've been using more recently - a -1 on a question is a good deterrent. $\endgroup$ Commented Aug 26, 2010 at 4:32
  • 1
    $\begingroup$ @Suresh: It was possible to vote-to-close during private beta, but it isn't possible in public beta before 500 rep. $\endgroup$ Commented Aug 26, 2010 at 7:26
  • 1
    $\begingroup$ Am finally at 1000 rep on the main site. will start editing if I can. I also deleted answers here relating to questions that I asked about which are now closed. $\endgroup$ Commented Aug 26, 2010 at 21:47
  • $\begingroup$ Let's close this. We have moderators and we have plenty of people who can vote to close. $\endgroup$ Commented Sep 4, 2010 at 16:32

13 Answers 13

6
$\begingroup$

What are some real world applications for genetic algorithms?

I think that this is offtopic, but should certainly be closed until it is made community wiki.

$\endgroup$
1
  • $\begingroup$ Maybe someone who understands metaheuristics could post a sample question that actually has theoretical content? $\endgroup$ Commented Aug 24, 2010 at 11:53
5
$\begingroup$

https://cstheory.stackexchange.com/questions/700/is-the-p-vs-np-problem-equivalent-to-the-x-vs-nx-problem

Reason: Not a real question.

$\endgroup$
5
  • $\begingroup$ also note that this question has already received 3 downvotes. Long-term, that might be a better mechanism because just from the front page it's possible to tell that a question isn't worthwhile. $\endgroup$ Commented Aug 28, 2010 at 7:25
  • $\begingroup$ It seems that the front page doesn't show the question any more. I guess questions with sufficiently many downvotes aren't considered "top questions", which makes sense. Hence even if you add a question here or vote-to-close, it might be a good idea to give some downvotes, too, to keep the front page clean. $\endgroup$ Commented Aug 28, 2010 at 11:19
  • $\begingroup$ Once a question has sufficiently many downvotes (this one is now at -5) is that in and of itself a reason to close (or delete, once we have moderators) the question? I've noticed this particular question re-appear on the front page (I think) on and off, despite now having 5 downvotes. I think it appears whenever it or an answer on it gets edited. $\endgroup$ Commented Aug 28, 2010 at 20:23
  • $\begingroup$ If I remember correctly, when enough people flag a question as spam it disappears from the front page. $\endgroup$
    – Kaveh
    Commented Aug 29, 2010 at 3:44
  • $\begingroup$ This question, after 25 edits so far, is now shaping up to be a real question. Perhaps time to review some of the downvotes? $\endgroup$ Commented Sep 1, 2010 at 17:59
4
$\begingroup$

What are the most effective algorithms to find random number?

Several reasons to close apply. I think a question that asks for recent pseudo-random generators that are not covered by Knuth's TAoCP would be on-topic.

$\endgroup$
2
  • $\begingroup$ A degree of imprecision in a question is not always a reason to close. $\endgroup$ Commented Aug 27, 2010 at 19:22
  • $\begingroup$ There is a difference between "a degree of imprecision" and "requires significant interpretation to assign any meaning at all". Several nice answers provided are to the generic question of how to define random numbers (for which Wikipedia already has good answers, I think) and how to generate these. I'm not sure these bear much relation to the question as asked, which specifically ask about random number generation "without there being any relation from one set of random numbers to any other set". This is a potentially interesting question, but needs clarification as it stands. $\endgroup$ Commented Aug 27, 2010 at 22:03
4
$\begingroup$

Major conjectures used to prove complexity lower bounds?

What is the question? The paper mentioned in the original post seems to give a good answer.

If this isn't going to be closed, can't we make it at least CW? Suresh has >1k rep, is this enough to CW questions?

$\endgroup$
2
  • $\begingroup$ >1k rep is apparently not enough to CW questions :(. $\endgroup$ Commented Aug 28, 2010 at 18:34
  • $\begingroup$ nope. not enough. We really need some moderators :) $\endgroup$ Commented Aug 29, 2010 at 3:23
2
$\begingroup$

Which algorithms have the greatest impact on our civilization?; the answers might be interesting, but this is highly argumentative.

Resolved: closed.

$\endgroup$
0
2
$\begingroup$

https://cstheory.stackexchange.com/questions/719/efficient-recognition-of-random-sequences

Doesn't seem to make much sense.

$\endgroup$
1
  • $\begingroup$ let's let it develop a bit. again, without moderator powers, there's little we can do $\endgroup$ Commented Aug 29, 2010 at 3:25
2
$\begingroup$

Learning quantum CS

Reason: voting to close as exact duplicate (OP concurs) of What is the quantum computational model?

$\endgroup$
1
  • $\begingroup$ There's a difference in the kind of answer sought: one wants summary explanations, the other wants a course of study. I'd want the scope of the former broadened before voting to close. $\endgroup$ Commented Sep 1, 2010 at 9:56
1
$\begingroup$

Question on "Why is P v NP so hard?" is subjective and would lead to a discussion.

Resolved: Closed.

$\endgroup$
1
$\begingroup$

(I don't know if this thread is still in use...) How to solve the recurrence relation

Homework question.

Resolved

$\endgroup$
0
$\begingroup$

Is there a complexity theory analogue of Rice's theorem in computability theory?

Close reason: 1) too vague; 2) under a reasonable interpretation, it is essentially a duplicate of Can it be determined if language L lies in NP?. It's only sort-of a duplicate, but I believe the answers to the two questions are identical.

Resolved? Despite the fact that the questioner has since clarified that he was essentially looking for a proof that $P \neq NP$, Ryan Williams's answer is interesting enough that I no longer think the question should be closed. If you have a different opinion say so in the comments.

$\endgroup$
10
  • 1
    $\begingroup$ To me it seems a reasonable question to ask. The fact that it is related to another question surely only means that any answer could point to the other question and point out the similarities. Perhaps simply asking the original poster to clarify the question is a better solution than closing it? It seems to me, at least, that we are being maybe a little too aggressive with closing some of the questions. $\endgroup$ Commented Aug 27, 2010 at 3:08
  • $\begingroup$ I think this question could be developed further. $\endgroup$ Commented Aug 27, 2010 at 4:45
  • $\begingroup$ Yes, this is way too aggressive. I am not sure you are fairly reading the question. $\endgroup$ Commented Aug 27, 2010 at 5:42
  • $\begingroup$ I wasn't sure about the question, but Ryan's answer indicates that it has merit. $\endgroup$ Commented Aug 27, 2010 at 6:42
  • 2
    $\begingroup$ Perhaps I was a bit too aggressive. Ryan's answer to the question is very interesting. But if you check turkistany's recent comments, he was indeed looking for a property of a language that could be proved to use it is not in P, that is, a proof that $P \neq NP$. $\endgroup$ Commented Aug 27, 2010 at 15:07
  • 7
    $\begingroup$ I don't like singling people out, but turkistany's questions are models of confusion. There's often an interesting nugget lurking inside, but it takes a lot of editing to bring it out. To whit, cstheory.stackexchange.com/questions/674/… $\endgroup$ Commented Aug 27, 2010 at 16:21
  • 2
    $\begingroup$ I agree with Suresh. There is something else which does not seem nice to me: posting a bunch of questions one after another in a very short time. I consider this as a possible sign that the author is not really interested in the questions. (He has posted 6 questions in a relatively short time.) $\endgroup$
    – Kaveh
    Commented Aug 27, 2010 at 18:28
  • $\begingroup$ @Kaveh: in and of itself, posting a bunch of questions in a short amount of time is not a bad sign, particularly when one first joins the site. Some people just have lists of boiling questions that they were waiting for an outlet for, and this site is it! But I agree that continuing to do that over time, particularly when the questions are poorly worded and confusing, is probably not a good sign. $\endgroup$ Commented Aug 27, 2010 at 19:46
  • $\begingroup$ I would prefer that someone who posts 6 one-liners in short succession take the time to turn a few of these throwaway queries into slightly more carefully worded questions. I am sure Suresh has better things to do than providing copy-editing services to someone who could have used online tools like wordnik.com or en.wiktionary.org to check usage and spelling. $\endgroup$ Commented Aug 27, 2010 at 22:14
  • $\begingroup$ hear hear. I'm only editing because I don't want the site cluttered with junk. Unfortunately, this has the side effect of bumping the question back to the front. $\endgroup$ Commented Aug 29, 2010 at 3:27
-1
$\begingroup$

Best 2D Cutting Stock Problem Algorithm.

Close reason: Not a real question.

Resolved: Closed by community.

$\endgroup$
-1
$\begingroup$

Exception handling for flow control ?

As pointed out by a commenter, this question is appropriate for StackOverflow, but not TheoryOverflow (or whatever we're calling this site nowadays).

Resolved: Closed by community.

$\endgroup$
-1
$\begingroup$

What is known about NP-hard set properties?

It's not clear to me what the question even is.

Resolved: Closed by community.

$\endgroup$
8
  • $\begingroup$ @Suresh: I added a comment on the original question with a reasonable interpretation of what turkistany might mean, and if that's indeed what he meant, it's not such a bad big-list/CW question. I say let it develop / wait and see what turkistany's response is. $\endgroup$ Commented Aug 29, 2010 at 21:31
  • $\begingroup$ not sure his response (just in) clarifies anything $\endgroup$ Commented Aug 29, 2010 at 21:53
  • $\begingroup$ I thought his response clearly implicitly accepted my interpretation, and just pointed out that he wasn't only looking for conditional properties (though I doubt many unconditional properties, if any, are known). $\endgroup$ Commented Aug 29, 2010 at 22:59
  • 4
    $\begingroup$ @Joshua: You have been extremely kind and patient with your attempts of saving this question, but I'm not sure if it is a good approach in the long run. First, it sends the message that people are interested in this kind of unclear questions and they are happy to help. Second, if you manage to turn an unclear question into a gem, then people start to upvote it and the original poster gets rewarded. I would rather see this kind of questions closed; if someone can extract some interesting ideas, they can open a new properly formulated question (giving credit to the closed one). $\endgroup$ Commented Aug 29, 2010 at 23:35
  • $\begingroup$ @Jukka: Thanks. I agree with your suggestion, particularly with regards to discouraging unclear questions. Too late for this one, though, since I already edited it to a reasonable question. If there is ever going to be something like a "Moderators FAQ", your suggestion should be added to it. $\endgroup$ Commented Aug 30, 2010 at 0:45
  • $\begingroup$ My thanks to Josh also. I feel, though, that we shouldn't rush to close these questions. I realize that reformulating vague questions to make some sense requires time out of the moderators, but I think/hope as the number of moderators grows, this will become less of a problem. $\endgroup$
    – arnab
    Commented Aug 30, 2010 at 4:15
  • $\begingroup$ I think his questions should not be edited, let him edit them himself, and if he can't make them reasonable, let them get closed. If you see some interesting way to make the question reasonable and think it is interesting ask it as a new question. My opinion is that he is not really interested in the questions he is asking. He should be asked for the motivation behind his questions and what he has done himself before asking them. $\endgroup$
    – Kaveh
    Commented Aug 30, 2010 at 6:05
  • $\begingroup$ Good comments, everyone. It doesn't make sense for someone else to get reputation b/c another person decided to be generous and make their question readable. $\endgroup$ Commented Sep 4, 2010 at 17:42

Not the answer you're looking for? Browse other questions tagged .