« first day (702 days earlier)      last day (4033 days later) » 

vzn
vzn
00:00
re this:
6 hours ago, by Raphael
138
A: How much research effort is expected of Stack Overflow users?

user414076A lot. An absurd amount. More than you think you are capable of. In fact, asking a question on Stack Overflow is the absolute last thing you ever want to do. You want to avoid it at all costs. You want to think of it as a horrible shame1 that will forever haunt you and pass down from you to your ...

uh, didnt you notice? thats all sarcasm....
oh and quite fascinating, esp the line at end "you did not do enough research"
deja vu all over again
re this:
6 hours ago, by Raphael
Now, we can argue whether closing immediately is the best approach. Should we not encourage to improve first, and only close if there is no improvement? Two issues.

1) We have no tool support for that. [I proposed some ideas.](http://meta.stackoverflow.com/questions/217494/how-to-train-your-growing-community-to-self-moderate)

2) People, in particular new users, keep answering dumps, thus rendering our policy void. We can't prevent that without closing (*or* vote-hammering those answering, as used to happen on [cstheory.SE], but I don't like that at all).
who is "answering [hw] dumps"? who knows what a hw dump is or not? do you guys have some extra special super psychic dump-detection powers? [& is that anything like "gaydar"? except for cs geeks?]
maybe you guys are turning dump paranoid....
5 hours ago, by Juho
Well... I don't think it's a waste of energy to keep the site healthy
want to see the site be healthy also!
its the means to that end that are subj to different schools of thought....
lets see
neither says anything about hw. huh!
huh, looking thru the meta archives. lets see what the policy is. aha!
10
A: Homework policy

anonPolicy We do not try to decide which questions are homework, and we don't use a special tag. Users that want to receive hints rather than full answers should say so, and answerers should honor such requests (by not posting details or hiding them in spoiler tags). Other than that, the usual quali...

huh! we do not try to decide which questions are hw!
 
5 hours later…
05:44
Hi all. I am reading an answer on cs.stackexchange: cs.stackexchange.com/a/10999/… Could someone shed some light as to whether B(r) element_of [1/2h(r), m(r)] is a set or an interval in this answer?
Sorry, I copied that from another room, here's the link: cs.stackexchange.com/a/10999/14464
 
1 hour later…
07:10
@MarcoPietroCirillo Interval. Doesn't make much sense otherwise, doesn't it? ;)
An interval of naturals would be denoted by [a..b] or [a:b] -- Knuth uses [n] for [1..n] -- but I think [a,b] is usually an interval of reals.
07:53
@Juho While I appreciate your editing, note that every edit bumps the main page. If you plan on making more than, say, 3-5 edits it's better to space them out a bit so you don't drown the latest posts.
Should we migrate this no questions asked?
3
Q: Why do we need so many transistors in a chip, and how are they managed?

user12979My knowledge is very vague as all we have are visual diagrams etc, but we have memory address and registers, the ALU being the heart(apparently). Single core CPUs process one instruction at a time AFAIK and multi-core have parallelism to some degree. So where do the millions of transistors come i...

 
1 hour later…
09:03
@Raphael Sure, I can do that (Although I think that should not be of any concern to anyone editing; edits should always be only encouraged and the system should make sure "new questions don't drown" somehow)
09:14
@Juho I agree, but so far no feature request stuck.
Arguments can be made for an edit to bump; if it was significant, the post may need and deserve new attention.
Even tag edits should bump some lists (those of the new tags at least).
Oh, and you want to see crank edits.
I think a check box "maintenance edit" should be available for higher reps which should hide thus edited questions from normal users (not mods, probably).
I was just gonna say that
so yes, something like
8
A: Is there a way to edit a question without bumping it to the front page?

Will NessNo criterion exists that will work in all circumstances here. Even one-character edit may be disastrous. This is ultimately a question of trust. At the most we can make such option available for "trusted users" - if we (the community here) indeed trust them not to abuse this option. I too have...

And Why do we need so many transistors in a chip, and how are they managed? is "hot network question". How does that happen?
09:35
What's a "hot network question" anyway? Enough views in a short enough time?
09:51
@Juho Apparently. It's also #1 in our "hot" tab.
Unfortunately, it's the broad and/or subjective questions that attract lots of views. The feature should probably use votes.
Incidentally:
17
Q: What is the Goal of "Hot Network Questions"?

jmacThere has been a tug-of-war in the hot-questions list. Community members like JonW seem to be unhappy with the traffic that it brings to their site: 'But we want to encourage people to post, that's the whole point of the HQ list!' I hear you cry. I disagree. We want to encourage people to th...

132
Q: What formula should be used to determine "hot" questions?

Jeff AtwoodRight now the front page Popular tab is fairly broken -- it's a simple descending sort by views. As Joel said in podcast #18, it is "a self-fulfilling prophecy." But this is not intentional, it's only because we haven't had time to improve it yet! As I sit down to write a better algorithm, I tho...

Oh, great one:
32
Q: The Anatomy of a Hot Question

jmacHere is the traffic since The Workplace was created: These are the three questions that caused those huge spikes in traffic: Is it rude to leave an interview early if you have already made your decision? How should I deal with an employee who has slept with my wife? What is a 'friendly' ...

 
7 hours later…
vzn
vzn
16:40
hot network question similar to one here on randomness
265
Q: How are pseudorandom and truly random numbers different and why does it matter?

PeterI've never quite got this. Just say you write a small program in any language at all which rolls some dice (just using dice as an example). After 600,000 rolls, each number would have been rolled around 100,000 times, which is what I'd expect. Why are there websites dedicated to 'true randomnes...

flag it for migration here wink =D
 
2 hours later…
19:06
@Raphael Thank you very much! After stepping through the proof again slowly I figured it out.
 
3 hours later…
22:05
@MarcoPietroCirillo Good to hear! :)
22:34
296
Q: How are pseudorandom and truly random numbers different and why does it matter?

PeterI've never quite got this. Just say you write a small program in any language at all which rolls some dice (just using dice as an example). After 600,000 rolls, each number would have been rolled around 100,000 times, which is what I'd expect. Why are there websites dedicated to 'true randomnes...

@Raphael hey can you help me with a small proof?
I asked the question here but seems to be getting no responses
0
Q: Proving a language is not recognizable

1337holidayI have the following question that I just want to verify I have done correctly. Seems like something is wrong here. Let $L$, $L_1$, $L_2$ $\subseteq \Sigma^*$ such that $L = L_1 \cup L_2$, and $L_2$ is decidable. Prove that if $L$ is not recognizable then $L_1$ is not recognizable. Proof Sup...

@1337holiday In principle, maybe. Now, no, unfortunately; it's almost midnight here. :)
@1337holiday Not over there I don.t :P
ahhh i see ok thats cool
But we might close that one as is; what do you think is wrong, and why?
well it made logical sense to me
i just thought it might have overlooked something
22:41
Hint: picking a fixed $L_2$ is forbidden. You proof has to work for all decidable $L_2$.
hmm i see, thats what i was thinking
The statement is not, "then not always X" but "then always not X" -- order is important there.
ok that helps, i will keep working on this
Good luck, have fun!
thanks a lot :D
22:43
You're welcome, that's what chat is for. ;)
22:58
@Raphael we discussed that one in the sec.se room. SU's the wrong place for it, fortunately it got a good (but not great) answer
@Gilles hey there, i was chatting with Raphael about a proof question, had it reworked and was wondering if you can take a look?
vzn
vzn
23:59
now proud winner of tumbleweed badge on both cs.se & tcs.se ... bookmark that! =D

« first day (702 days earlier)      last day (4033 days later) »