@Gilles Seriously? My version states some facts and then asks a clear question. The only word you can possibly consider judgemental is "inferior" (which I would label as snarky). Maybe "censor", too, but I think that's fair. Sorry, I really don't see what you think is incomprehensible, or a rant. But then, I am the author.
> There are many closed-platform computing devices on the market these days that do not have an (normaly/easily accessible) general-purpose programming interface.
starting with my comment. No reason not to take it with a pinch of salt in an informal context as that question.
@Gilles If I would edit every question down to the bare essentials, I would be fired pretty soon. In this case, I introduced stuff to enable our interpretations to be reasonable. I think you dramatically overestimate the importance of the word choice "sell" here. But if three word choices disqualify a question for you, please go ahead.
@Raphael it's that, and removing the reference to the iPhone (the answer is not necessarily the same on all "closed" devices), and adding the app store which is kind of a sidetrack. You turned a question that was simple to understand into a mish-mash
@Gilles We can argue whether looking at one machine and not an (abstract) class of machines is CS, but I'm tired of this. Please proceed as you see fit. I hope the OP returns to clarify (not that I think there is anything to clarify, but I'll give you the benefit of doubt).
@Raphael I don't think there's anything to clarify either. The original question was clear enough. I don't want to go into an edit war, I'll wait till others chime in.
I was reading Linux Kernel Development by Robert Love, where I came across this
Linux takes an interesting approach to thread support: It does not
differentiate between threads and normal processes.To the kernel, all
processes are the same— some just happen to share resources.
Now, I am...
Many areas in the world suffer from conflicts between two groups (usually ethnic or religious). For the purpose of this question, I assume that most people of both sides want to live in peace, but there are few extremists who incite hatred and violence. The goal of this question is to find an obj...
I really wonder how torrent downloads can be resumed at later point of time.
If such a technology exists then why in browsers it is not possible.
I guess, everyone might have faced the following situation in his life sometime.
When you are downloading a file from browser or say using some downlo...
Context: I'm working with this problem - http://stackoverflow.com/questions/10875675/how-to-find-out-all-the-popping-out-possibilities-of-two-stacks
The problem is this: If you have two source stacks with n unique elements (all are unique, not just per stack) and two destination stacks and you p...
Say that $a_1a_2\ldots a_n$ and $b_1b_2\ldots b_n$ are two strings of the same length. An anagramming of two strings is a mapping $p:[1\ldots n]\to[1\ldots n]$ such that $a_i = b_{p(i)}$ for each $i$.
There might be more than one anagramming for the same pair of strings. For example, If $a=$ab...
I have the following problem:
We want to implement a filtering strategy in e-mail servers to reduce the number of spam messages. Each server will have a buffer, and before sending an e-mail, it checks whether there is a duplicate of the same message in its own buffer and contacts k distinct n...
@Raphael left a comment on Linux: Are threads and processes really treated equally?. On the face of the question it's SO material, but if it's posted to CS maybe the question is just badly formulated. What bothers me is the answer, which is an SO answer, not a CS answer
I'm confused about you saying UNIX was the wrong site. I read the question as "How does Linux work?" not "How do I program threads on Linux?". Maybe that's wrong, but would the former question not be ontopic on unix.SE?
@Gilles Then he picked the wrong name for cs.SE. But interesting approach.
Maybe it would be better to name the tag "interprocess communication" with "ipc" a tag alias, for the benefit of not-native speakers of English and other people without a lot of programming jargon.
You know that cartoon at the beginning of Garey and Johnson, with the algorithm designer saying to his boss "I can't find a good algorithm, I guess I'm just too dumb," and then, after the problem is shown to be NP-complete, he is saying instead "I couldn't find an algorithm, but neither could all these famous people!"
Hey, I couldn't find an algorithm significantly better than brute force, but neither could all those famous people!
I'm not sure that is a healthy attitude. Healthy for the field, I mean. It biases many people towards believing P!=NP (save my ego!). No offense intended, just a wistful remark.
I was reading Linux Kernel Development by Robert Love, where I came across this
Linux takes an interesting approach to thread support: It does not
differentiate between threads and normal processes.To the kernel, all
processes are the same— some just happen to share resources.
Now, I am...
Say that $a_1a_2\ldots a_n$ and $b_1b_2\ldots b_n$ are two strings of the same length. An anagramming of two strings is a mapping $p:[1\ldots n]\to[1\ldots n]$ such that $a_i = b_{p(i)}$ for each $i$.
There might be more than one anagramming for the same pair of strings. For example, If $a=$ab...
I have the following problem:
We want to implement a filtering strategy in e-mail servers to reduce the number of spam messages. Each server will have a buffer, and before sending an e-mail, it checks whether there is a duplicate of the same message in its own buffer and contacts k distinct n...
