“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.”
So one thing that came out of our recent chat meeting was that (and I'd sort of guessed this by nosing at people's profiles to work out how much SE-wide experience you have) some of our high rep members are unsure about how the close vote system works. So, I'm going to take this opportunity to wr...
it's true that we don't have moderators yet, but we do have 5 users who are regularly on chat, so if you see a question worth reopening you can post a link here
@RanG it indicates that the question is not welcome (in its present state), removes it from the list of unanswered question, and makes it a candidate for eventual deletion
@Gilles oh, OK. I know question should be closed, but it seems the OP is trying to improve it.. this is why I was hesitant. Don't wish to scare people away..
So, what's the purpose of downvoting?
or is it the same - closing will come as a consequence of downvoting?
downvotes do tend to stick more than closure, though, because only you can change your vote, whereas a closure can be reverted by any 5 user or any mod
I understand that a Church numeral $c_n$ looks like $\lambda s. \lambda z. s$ (... n times ...) $s\;z$. This means nothing more than "the function $s$ applied $n$ times to the function $z$".
A possible definition of the $\mathtt{times}$ function is the following: $\mathtt{times} = \lambda m. \la...
I was considering posting a question asking for examples of grammars that show that SLR(1), LALR(1) and LR(1) are different, but that'd be a seeding question and we're supposed to no longer need those :S
It's a nice question though - I think I've seen something similar on SO once
Where can a person go to discuss issues and ideas of open problems in computational complexity? Prepublication?
Mailing lists, forums, IRC, chat, personal messages, experts willing to share their knowledge and encourage development?
(this is related to my other question, see here)
Imagine a screen, with 3 windows on it:
Suppose each window is represented by a tuple (x, y, width, height).
I'd like to find an efficient way of generating all unoccupied points inside the red bounding rectangle.
In the above example, we hav...
For the following jobs:
The average wait time would be using a FCFS algorithm:
(6-6)+(7-2)+(11-5)+(17-5)+(14-1) -> 0+5+6+10+13 -> 34/5 = 7 (6.8)
What would the average turnaround time be?
When I was explaining the Baker-Gill-Solovay proof that there exists an oracle with which we can have, $\mathsf{P} = \mathsf{NP}$, and an oracle with which we can have $\mathsf{P} \neq \mathsf{NP}$ to a friend, a question came up as to why such techniques are ill-suited for proving the $\mathsf{P...
I am recent graduate from a UK university in computer science. As I am not sure what to study for my master degree, I went for a Web-Developer graduate job, and got accepted. As I will probably go for a master in 1-2 years, I was wondering if my undergraduate degree will be consider useless. And ...
(this is related to my other question, see here)
I would like to write a function that scores a given arrangement of windows on a screen.
The purpose of this function is to determine whether a particular layout is good and by going over other possible layouts, finding the one with the highest s...
My simplified analysis:
dequeueMax: linearSearch, removeElementAndShrinkArray
for 1st element if number of elements is N:
linearSearch takes N comparisons in any case
removeElementAndShrinkArray has to make N/2 moves on average, (N in worst case)
for the next element: N-1 and (N-1)/2
for the 3rd ...
Well, all is in the title. But here are the reason for my question.
I recently realised that there may be, in fact, 2 main differences:
Type-constancy: symbols (vars in the widest sense) have types constantly known and fixed at design time, meaning they have the same type on every application/...
Suppose we have 2 kernel functions $K_1(x,y)$ and $K_2(x,y)$. We know, that the dataset ($(x_1,y_1),\ldots,(x_l,y_l),$ $y_i \in \{-1,1\}$ ) is separated with the first one (that is, there are $w,$ $w_0$: $$y_i(K_1(w,x_i)-w_0)>0 $$ for all $i=1,\ldots,l$ ), and not separated with the second ker...
Where can a person go to discuss issues and ideas of open problems in computational complexity? Prepublication?
Mailing lists, forums, IRC, chat, personal messages, experts willing to share their knowledge and encourage development?
Well, all is in the title. But here are the reason for my question.
I recently realised that there may be, in fact, 2 main differences:
Type-constancy: symbols (vars in the widest sense) have types constantly known and fixed at design time, meaning they have the same type on every application/...
Suppose we have 2 kernel functions $K_1(x,y)$ and $K_2(x,y)$. We know, that the dataset ($(x_1,y_1),\ldots,(x_l,y_l),$ $y_i \in \{-1,1\}$ ) is separated with the first one (that is, there are $w,$ $w_0$: $$y_i(K_1(w,x_i)-w_0)>0 $$ for all $i=1,\ldots,l$ ), and not separated with the second ker...
