oggy

16 ms·

91.
by oggy 13y ago
Are the collectors aware of the order in which they talk to the seller? That is, is the 4th collector aware that he's the "last chance" for the seller?
92.
by oggy 13y ago
So sad to hear this. There are many great guitar players out there, but to me he was probably the greatest. Technically he was impeccable, but that's not it... his playing just had some crazy fervor to it. Some of his stuff is just, if
93.
by oggy 13y ago
Actually, I've heard of German professors who used the word "Schoenfinkeln" instead of "currying". You sometimes get people who try to fight the English influence off at all costs ;)
94.
by oggy 13y ago
Am I reading the patch correctly in that Android versions below 4.1 are not affected?
95.
by oggy 13y ago
The GP did not say we're living in a dictatorship right now, merely that such a possibility in the future should not be dismissed out of hand. Oh and by the way, you are familiar with the fact that the American government has murdered
96.
by oggy 13y ago
If you're on a Mac, why not give Ardour a spin? It won't do MIDI sequencing inside of the program (you will need Ardour 3, which AFAIK only runs on Linux), but it's highly usable for everything else. And it's open source
97.
by oggy 13y ago
This article has a bit of an "ivory tower" reek to it, I don't wholly buy it. Some points are clearly valid: use modern crypto primitives if you can, and know their properties. But things are more complicated than that. First
98.
by oggy 13y ago
Integer factoring is not (known to be) NP hard, i.e. we don't know whether we can reduce any NP problem to integer factoring (we suspect we cannot). On the other hand, it's in the intersection of NP and Co-NP, because you can give an effect
99.
by oggy 13y ago
Fair enough, I don't have the printed version around. It's wrong on that point and I can see that it can be misleading. To their credit, here's the current formulation from the online version: > Members of Show can be presented as strin
100.
by oggy 13y ago
To be honest, it does not seem you did a very good job of reading the book. If you're rooted in imperative languages, it takes some effort. I read the book when I had already had some basic functional programming experience, so my experienc
101.
by oggy 14y ago
Same here, it was him who committed my first Django patch. He also came across as an incredibly nice person, with very thoughtful and kind comments. I've also read some of his ORM code and that was some of the nicest Python I've ever read.
102.
by oggy 14y ago
Sorry, I guess that it's the default assumption since most people do come from an imperative background. And you had to choose a language with significant whitespace as your first imperative language, that's just low ;) But essentially, in
103.
by oggy 14y ago
You're welcome. But I'm now not sure if I got my point across correctly on the monad part of the post (but then again, smarter people than me have failed on that front). I'm confused about what you mean with syntactic sugar. I wouldn't call
104.
by oggy 14y ago
Heh, fair point. I guess it can read like that. I'll expand. Monad transformer = thing that can transform a monad into another one with additional primitive operations. Monads are more or less the Haskell way of achieving something akin to
105.
by oggy 14y ago
Kiselyov et al have an interesting paper on logic programming in Haskell [1]. They introduce a backtracking monad transformer with fair disjunctions, and negation-as-failure and pruning operations. And the implementation is based on continu
106.
by oggy 14y ago
Another excellent algorithms book that never seems to get any attention is Udi Manber's "Introduction to Algorithms: A Creative Approach". Unlike the standard "algorithm catalog" books, where the standard algorithms are merely presented, it
107.
by oggy 14y ago
There is a virtualenv-like tool for Haskell: https://github.com/Paczesiowa/hsenv I'm hardly an advanced Cabalist, but it does the job nicely for me, and is quite stable at that too. Like virtualenv, it can also create a "sandboxed" GHC, s
108.
by oggy 14y ago
It's a perfectly sensible question. Knowing that both O(2^n) and O(3^n) are sets, and using the definition of set equality, it asks whether "f in O(2^n)" implies "f in O(3^n)", and vice versa. Only one of the implications holds...
109.
by oggy 14y ago
Hah, I eat corn the same way. I also use Emacs, but with viper and vimpulse since I prefer modal editing. For programming, I'd currently favor Haskell or Python. My undergrad major was math, and I much preferred algebra. Will I never fit in
110.
by oggy 14y ago
I majored in math with a minor in CS (undergrad). Of his entire technical explanation, I'm only familiar with the notions "automorphism" and "topology". To add insult to injury, I did have a course on topology, but it covered only so-called
111.
by oggy 14y ago
If you're interested, the German Verisoft project [1] aims at such pervasive verification. AFAIK they haven't yet verified anything matching the complexity of seL4, but they did verify a simple real-time OS. Of course you do need to stop so
112.
by oggy 14y ago
The target code for the seL4 project is actually written in C. They do however use Haskell as a stepping stone (they have an abstract spec of their system, which they then prove is implemented by a Haskell implementation, which is in turn
113.
by oggy 14y ago
I do some work on formal verification, so I can talk about it from that perspective. Purely functional code is the easiest to reason about, but then again you a) can't interact with the "real world" in pure code, and b) "safety critical" of