bdhe

36 ms·

331.
by bdhe 16y ago
I remember using Pi^2 to be approximately g (the acceleration due to gravity near the earth's surface). This comes in real handy when simplifying the time period of a pendulum.
332.
by bdhe 16y ago
Can someone elaborate on what it means to share a website over LinkedIn?
333.
by bdhe 16y ago
> Parents. Their future job is usually decided for them before they're even born. This is patently untrue. Parents usually have high expectations of stable, well-earning jobs, but in no way decide before they are even born. It might app
334.
by bdhe 16y ago
> Having less volition intuitively explains a lack of passion, but I'm not convinced that it does a great job explaining a lack of competence -- passion can be replaced by discipline and social pressure. Yes, my point was that it would
335.
by bdhe 16y ago
An important, but tangential point to note is that unlike the US, college education in India does not allow for a student to independently chose his/her major. People join colleges already deciding (without taking a single course) what they
336.
by bdhe 16y ago
> The OP article had me going, because it was partially correct about the film being a hagiography. I think the idea and principles that Gandhi stood for are nevertheless important just as the ideas and principles the Founding Fathers o
337.
by bdhe 16y ago
This is not news. A very uninteresting april fools joke article.
338.
by bdhe 16y ago
> British just came, looted and left. It would be good if people stopped attributing every god-damned thing about India to the "British Influence". My bad. I just wondered, considering that British humour is a lot dryer than American hu
339.
by bdhe 16y ago
I've noticed people from the Indian subcontinent tend to be a lot more sarcastic than Americans. I wonder if it is a relic of the British colonization.
340.
by bdhe 16y ago
> Attacks in Tunisia and only open WiFi networks are the sort of attacks which can defeat revocation. Could you give more details about this statement from your essay?
341.
by bdhe 16y ago
> Or something like that. I'm not really that clear on the details. :( Your intuition is correct. Quantum algorithms seem to perform better than classic algorithms because there are certain operations (like fourier transforms) that can
342.
by bdhe 16y ago
> It would be impossible to get anything done business-wise ... You'd be surprised how a background verification and other processing for a passport application can require four months without a bribe but less than a couple of weeks if
343.
by bdhe 16y ago
It is just a technicality. If you know an upper bound on the running time you can simply run it for that many time steps and then return "no" if it doesn't halt by then (because it could never thereon answer "yes"). This only works with con
344.
by bdhe 16y ago
I think I was mistaken in understanding what you said. Yes, factoring is in NP, but it is not known to be NP-hard. Being in NP doesn't automatically imply its usefulness in Crypto (because, as you say, P is a subset of NP). Neither does the
345.
by bdhe 16y ago
The corrupt official is not going to be straightforward. Think of a convoluted system where the official can put you behind tons of red tape (you might literally spend hours filling up nonsensical forms). But a small price to pay and -poof-
346.
by bdhe 16y ago
> If P = NP, and someone solves any NP-complete problem, all the NP-complete problems crumble and our security is a thing of the past. Security can still be achieved. But it will require exponential time for an honest participant (a muc
347.
by bdhe 16y ago
> Factorization is indeed in NP. It might also be in P. I should've said "based on the idea that" instead of "the fact that." I'll reiterate. It is unknown if factorization is currently NP-hard. UKNOWN. It is most likely NOT NP-hard oth
348.
by bdhe 16y ago
We already have algorithms for all NP problems, by Levin. See: http://en.wikipedia.org/wiki/P_versus_NP_problem#Polynomial-... No one knows whether it runs in polynomial time though! It runs in polytime if P=NP.
349.
by bdhe 16y ago
> Well, n^3 or n^4 might already be considered impractical in many situation and even linear time algorithms might have huge constants that make them impractical. Ah, so you now you can see how pathetic our understanding of computationa
350.
by bdhe 16y ago
This is a followup, 15 yrs later from the rest of the TCS community: http://cstheory.stackexchange.com/questions/1026/status-of-i...
351.
by bdhe 16y ago
That's an interesting read! I think his point is that NP-completeness does not give you an intuition about the hardness of automating creativity. That point is granted. However, if P were equal to NP, then it would imply that we can wri
352.
by bdhe 16y ago
> The fact that she is willing to perform her job for this salary and other benefits shows definitely that she values her compensation more than she values what she could otherwise derive from any other opportunity open to her. If there
353.
by bdhe 16y ago
I'm sure a lot of people are "worried" about that. Remember, the mathematical community went through the same thing about 80 or so yrs ago when Gödel came up with his Incompleteness Theorem just about when most of the mathematical world bel
354.
by bdhe 16y ago
> many NP hard problems have practical approximations, many P problems are prohibitively costly to solve. I don't know if there is more to Sariel Har-Peleed's piece than the one paragraph in the poll, but as of today, most P problems us
355.
Ask HN: Why does tor.org redirect to yahoo.com?
1 points by bdhe 16y ago|0 comments
356.
Ask HN: Unusual activity alert for GMail by email?
1 points by bdhe 16y ago|0 comments
357.
by bdhe 16y ago
A good rule of thumb is to use sans-serif when possible for lots of text. Displays that are lower resolution will render serifs poorly, or just subtly bad enough to make reading difficult. You could give the user to switch between serif and
358.
by bdhe 16y ago
> What a... strange set of complaints. It's one of those things that is so fascinating to read because I can't understand what he doesn't understand. Absolutely spot on. I wondered for a moment halfway whether it was meant to be satire.
359.
by bdhe 16y ago
> If there is a proven theorem that something is impossible, either the theorem is wrong or it's impossible. It can get a lot more subtle than that. I do not want to elaborate, but there are classes of problems for which we can only gua
360.
by bdhe 16y ago
With a caveat added: "... in general". As mentioned by sokoloff, the halting problem is solved routinely by people in software engineering research groups. This does not invalidate the Halting Theorem simply because the Halting Theorem talk

More ›