drostie

93 ms·

541.
by drostie 13y ago
You're right. We should stop calling anything a button which is not used to fasten cloth via a buttonhole, even if the entire English-speaking world uses the term euphemistically to refer to round things.
542.
by drostie 13y ago
So, two years ago or so I started a project in the middle of my Master's -- not a great time to focus purely on that project. The idea was to replace Node.js's callback hell with Scheme-type promises (i.e. deferreds), ideally preventing mos
543.
by drostie 13y ago
It's actually a really easy bit of reasoning once you've got the "hang" of it. (sorry, bad pun.) Let the blocks have length 2 and look at the problem backwards: the topmost book's furthest-from-the-ledge edge is x=0, then x increases as we
544.
by drostie 13y ago
The first green tick apparently does not test for username existence, but only an acceptable username format. I think there may be interactive attack models against logins where you separately report "this user does not exist" from "the pas
545.
CircuitLab - Draw circuit diagrams and simulate what they do(circuitlab.com)
3 points by drostie 13y ago|0 comments
546.
by drostie 13y ago
The earliest RFC which I know of which spells it out is RFC 805, https://tools.ietf.org/html/rfc805 It was clear that the information content of all these syntactic alternatives was the same, so that the one causing le
547.
by drostie 13y ago
It's just that they have access to an operation which classically doesn't exist, because their probabilities are complex numbers rather than real numbers. (Just as importantly, there are known limits to how great their correlation can be; t
548.
by drostie 13y ago
Let me be a little more precise here. What you basically need to know here is that entanglement describes a correlation between measurements , and you cannot know whether that correlation exists until you collect those measurements togethe
549.
by drostie 13y ago
I don't know precisely what you're asking because the whole point is that there are three measurements (measure qubit 1, entangling-measure qubits 2 and 3, and measure qubit 3) whose time-order does not matter. There is a nice theorem in qu
550.
by drostie 13y ago
(I am not a lawyer, this is not legal advice.) I understand that you want to extend professional courtesy to the lawyers and programmers involved, and by all measures, I think you should do so. However you must understand that the DMCA take
551.
by drostie 13y ago
(Sorry, my first line was wrong.) You set all of the low bits to 1 for N - 1, not N. So 4 becomes 3 becomes 3 becomes 4; 5 becomes 4 becomes 7 becomes 8. In Haskell you'd write: nextPowerOf2 N = fill_bits (N - 1) + 1; Mansour Moufi
552.
by drostie 13y ago
Is it distributed nowadays? I vaguely remember Datomic as having a single-point-of-failure "transactor" which every request had to go through. (Given the specialized name, maybe the transactor itself doesn't have to do very much; but it sti
553.
by drostie 13y ago
I like this idea of modern proverbs, and look forward to finding more in the HN Comments. Here's what I'll provide: No story survives contact with the players: they will always outsmart you and come up with a novel solution to your best-des
554.
by drostie 13y ago
Assuming that the FFTs handle independent slices of data (as I can't see why you'd go back to the time domain), the data throughput they're handling is 2048 * 15 bits * 80 Hz = 2.5 Mbps. That may sound like a lot, but it's not unprecedented
555.
by drostie 13y ago
Well, "a bit expensive" in relation to what? A virtual private server costs $10/month for example, so it's an order of magnitude more expensive. My domain doesn't even get 10 hits per day but I pay for the service anyway and maybe someday I
556.
by drostie 13y ago
About 10 years ago I read a ton of Karl Marx, and the biggest thing which struck me was that the vocabulary to describe what he was talking about was not invented until modern times -- he talks of the "mechanisation of the means of producti
557.
by drostie 13y ago
First off, you need to understand what DNS does. There is a non-profit in Los Angeles called ICANN with a department called IANA, and this non-profit gives several companies special monopolies on selling "top-level domains" -- those compani
558.
Universe as an Infant: Fatter Than Expected and Kind of Lumpy(nytimes.com)
1 points by drostie 13y ago|0 comments
559.
by drostie 13y ago
I've long loved the Fibonaccis and the Golden Ratio; here are some of my more-readable notes on what exactly is going on in their connection, and why the golden ratio is the most irrational number: https://github.com/drostie/essay-seeds/bl
560.
by drostie 14y ago
This is a great question! I freely confess that I'm not totally sure about the fully homomorphic systems, but you are making the assumption that you can test for equality "outside" the cryptosystem, and for at least one partially homomorphi
561.
by drostie 14y ago
"Fully homomorphic" means "a computation can be done on two encrypted values without decrypting them." It is an extension of partially homomorphic systems, which allow some computation which cannot be extended to arbitrary computations. A
562.
by drostie 14y ago
Just to be 100% clear about the culture, people don't pirate because "not buying" is "hard" -- what an absurdity; not buying is like not eating, it's the easiest thing ever: just don't do something. (I mean, you can whine about biological
563.
by drostie 14y ago
Just to respond a little, I actually just finished with my Master's in applied physics, so yeah, it can work with an academic life. ^_^ Actually it can even be beneficial, much like turning off the Internet -- where yes, you lose access to
564.
by drostie 14y ago
One tip which I didn't see: set an alarm for going to bed , not waking up . You should be able to wake naturally, but artificial lighting changes your perception of when you should go to sleep, shifting you from a naturally 23-hour circa
565.
by drostie 14y ago
Saying "NP-complete problems remain so in the quantum world" is a bit imprecise because NP-complete is simply defined as a set of problems which can be solved by classical nondeterministic computers. Of course it "remains so" in the quantum
566.
by drostie 14y ago
In order to satisfy the basic matrix transformation properties dot = lambda M, v: vector(sum(M[i][j] * v[j] for j in range(len(v)) for i in range(len(M))) as well as the basic left-t
567.
by drostie 14y ago
The culture of the company also matters. Joel Spolsky talked a bit about administration as creating "abstraction layers", and what's happening here seems like tiered administration (which I guess is a working definition of bureaucracy ).
568.
by drostie 14y ago
I hope that everyone watches the full set of four videos of Ira Glass on storytelling from which this comic was excerpted: https://www.youtube.com/watch?v=loxJ3FtCJJA&playnext=1&#... It's important because you get a different perspect
569.
by drostie 14y ago
It's hard to identify a practical reason because presumably using your existing PHP stack is going to be easier for you than learning how to run a Haskell stack. Every new language comes with such barriers. It's sometimes hard to see how
570.
by drostie 14y ago
The "unless it's a common word" thing is the problem, really. I tried to do a more Markovian filter at my work and it bombed -- nobody enjoyed trying to get around its entropy restrictions. All it did was assume that your next letter would

More ›