Area 51 » Technology

211

followers

13 Closed Questions (show all)

active newest votes

up vote 10 down vote

added by wdudhnath Feb 17 '17 at 15:09

closed as not a real question by Robert Cartaino Oct 16 '17 at 14:11

It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form.

On the actual site, this would be consider a list question and closed as "too broad". Questions are generally expected to contain a specific problem statement that can be definitively resolved in the space of a post. This is more of a broad discussion and not a good fit for this style Q&A site. – Robert Cartaino Sep 8 '17 at 16:17

up vote 10 down vote

added by EvgeniyZh Mar 16 '17 at 8:23

closed as not a real question by Robert Cartaino Oct 16 '17 at 14:13

It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form.

	You want to list them all? On the actual site, this would be closed as "too broad". Questions are generally expected to contain a specific problem statement that can be definitively resolved in the space of a post. This is more of a broad discussion and not a good fit for this style Q&A site. – Robert Cartaino Sep 8 '17 at 16:19
	This could be improved by adding a context. By adding the possible uses of the computing in context XYZ then that would narrow down the options without changing the question to a large degree. – Jake Symons Nov 11 '17 at 19:47
	The problem then is that it would be too localised - sure, the applications in either a 5 or 20 qubit system aren't anything major, but the applications of a 50 qubit system would be vastly different, which I hope they'll have in the cloud in a couple of years. Add more qubits and the answer changes yet again – Mithrandir24601 Dec 10 '17 at 14:53

up vote 10 down vote

added by 41041729 Apr 12 '17 at 14:08

closed as duplicate of Are Cryptographic hash functions quantum secure? How is quantum computer going to effect the modern Cryptographic primitives? by Robert Cartaino Oct 16 '17 at 14:12

This question covers exactly the same ground as another question in this proposal.

While this may not be closed as an "exact duplicate" on the actual site, for the purpose of evaluating the scope of this proposal, combining questions all asking, essentially, how quantum computing affects cryptography helps assure we have a sufficient breadth of subject matter to actually create this site. – Robert Cartaino Sep 8 '17 at 16:32

up vote 10 down vote

added by blalasaadri Apr 29 '17 at 0:01

closed as not a real question by Robert Cartaino Oct 12 '17 at 15:32

It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form.

This is a call to generate an unbounded list with somewhat vague criteria. On the actual site, this would be closed as "too broad". Questions are generally expected to contain a specific problem statement that can be definitively resolved in the space of a post. This is a generalized call for a broad conversation and not a good fit for this style Q&A site. – Robert Cartaino Sep 8 '17 at 16:16

up vote 10 down vote

added by tuskiomi Jul 7 '17 at 18:27

closed as duplicate of Are Cryptographic hash functions quantum secure? How is quantum computer going to effect the modern Cryptographic primitives? by Robert Cartaino Oct 16 '17 at 14:11

This question covers exactly the same ground as another question in this proposal.

@RobertCartaino Howso? I Think that there are suffecient child questions to be asked here. For example, there is not a single "What is Ohm's law?" Question on Electronics.SE that Nullifies all Power management questions. This is not more different than that. While there are questions with power management that contain redundant info about ohm's law on other questions, they're still not even close to off topic, nor are the bigger questions which ask about the topic as a whole. Closing this limits the attempt to see the bigger picture that this site provides as a whole, and stunts fundamentals. – tuskiomi Sep 8 '17 at 16:35

@tuskiomi You don't want to fill a proposal with a lot of "child questions". The purpose of the proposal process is to help define the scope. There were a lot of repetitive questions all asking, essentially, if/how QC will break encryption, so I picked a representative example to cover that space. Trying to keep them all open here despite my explanation does not strengthen the case for building this site. – Robert Cartaino Sep 8 '17 at 16:42

@RobertCartaino So you're saying that they'll likely be on topic if the beta launches, but it is not appropriate here, where we try to discern what IS on topic? – tuskiomi Sep 8 '17 at 16:45

Correct, although I wouldn't call them "inappropriate." More like repetitive or redundant where outlining the basic scope is the goal of this exercise. This is just a routine cleanup activity to help flesh out a stronger proposal moving forward. – Robert Cartaino Sep 8 '17 at 16:49

up vote 0 down vote

added by Henry WH Hack v3.0 Sep 20 '17 at 17:41

closed as duplicate of Can a quantum computer run an operating system? by Robert Cartaino Nov 29 '17 at 16:06

This question covers exactly the same ground as another question in this proposal.

up vote 0 down vote

added by Arunav MAHESHWARI Oct 24 '17 at 11:15

closed as duplicate of Does creating a quantum algorithm that runs in polynomial time for an NP-complete problem prove P=NP? by Robert Cartaino Nov 29 '17 at 16:08

This question covers exactly the same ground as another question in this proposal.

The first part to this appears to be a duplicate of this question on whether quantum computers could prove P=NP. I'm not sure what you mean by the second part of your question - the significance and difference of what? – Mithrandir24601 Oct 24 '17 at 13:31

up vote -2 down vote

added by wdudhnath Feb 17 '17 at 15:05

closed as too localized by Nij, wythagoras, Chenmunka, Helmar, tuskiomi Jul 7 '17 at 18:25

This question is unlikely to ever help any future visitors; it is only relevant to a small geographic area, a specific moment in time, or an extraordinarily narrow situation that is not generally applicable to the worldwide audience of the internet.

This is changing too fast to be useful. – wythagoras Feb 20 '17 at 18:22

@wythagoras. While in principle it could become outdated, I wouldn't mind someone pointing out examples of which gates have been implemented and how. Just an overview, doesn't have to be deeply detailed. – snulty Mar 8 '17 at 9:55

up vote -2 down vote

added by 41041729 Apr 12 '17 at 14:01

closed as duplicate of Are Cryptographic hash functions quantum secure? How is quantum computer going to effect the modern Cryptographic primitives? by Robert Cartaino Sep 8 '17 at 16:29

This question covers exactly the same ground as another question in this proposal.

Maybe reword to something like "What influence could quantum computing have on Cryptography?" or "Which kinds of Cryptography are in danger through quantum computing?". A "How important is X"-question can only be answered with "very important", "somewhat important", "not important" or something of the kind - which isn't helpful. – blalasaadri Apr 29 '17 at 0:12

up vote -3 down vote

added by wdudhnath Feb 17 '17 at 14:59

closed as too localized by Nij, wythagoras, blalasaadri, Helmar, tuskiomi Jul 7 '17 at 18:25

This is trying to hit a moving target. The latest as I write my answer, could be deprecated by the time you read it. Generally a bad concept for a knowledge store, which is the goal of SE sites. – RandomThought Jun 25 '17 at 2:31

up vote -3 down vote

added by HowToCompute Feb 20 '17 at 17:36

closed as not constructive by Chenmunka, Nij, John Militer, tuskiomi, Helmar Jun 24 '17 at 10:42

This question is not a good fit to our Q&A format. We expect answers to generally involve facts, references, or specific expertise; this question will likely solicit opinion, debate, arguments, polling, or extended discussion.

I don't think a close vote on this is helpful. It's a fairly legitimate 'reference request' (called that on other sites). I think there should be at least one standard one which can be referred to, maybe make it a community wiki. – snulty Mar 8 '17 at 9:57

any question that asks for "the best" is almost unilaterally nuked as POB everywhere on Stack Exchange. This is not a reference request, it's a poll or list question, and those are two very different things. – Nij Mar 10 '17 at 9:00

@Nij, To be fair there's no question to accompany the title. I would've taken best to be a turn of phrase for 'good'. I mean no one is going to ask "What are some terrible books to learn about X". Would you nuke all reference requests if they asked for "good" books, because maybe people will disagree on what counts as a good book. Or would you prefer the question as phrased by EvgeniyZh? – snulty Mar 17 '17 at 1:59

up vote -4 down vote

added by EvgeniyZh Mar 13 '17 at 20:01

closed as too localized by blalasaadri, tuskiomi, Helmar, Henry WH Hack v3.0, Itamar Green Jul 21 '17 at 7:58

up vote -6 down vote

added by wdudhnath Feb 17 '17 at 14:56

closed as not a real question by Nij, Chenmunka, heather, KOB, blalasaadri Apr 29 '17 at 0:09

It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form.