ky3

14 ms·

121.
by ky3 12y ago
I tried to search for S3-API-compliant alternatives to amazon. So far I've only come up with the S3 wikipedia entry: Google Cloud Storage, Openstack Swift, Cloud.com’s CloudStack, Cloudian, Connectria's Cloud Storage, Eucalyptus,
122.
Review: House of Debt by Atif Mian and Amir Sufi(mathbabe.org)
1 points by ky3 12y ago|0 comments
123.
by ky3 12y ago
And to add to this, the unspoken Hungarian notation rules have xs typed as a list. So the 1st instance: [x,xs] looks unprofessional and n00b-ish. It's the 2nd instance that's idiomatic.
124.
by ky3 12y ago
> Why do I get so many pattern matching errors even with -Wall? :( The last one stings the most, believing my program would never crash. I hope your programs never crash, and in the meantime could you explain what > Why do I get so m
125.
by ky3 12y ago
Good point about the macros and mutability. There's FP vs imperative and then there's FP vs OOP. Scala is the FP-OOP hybrid and Scheme is the FP-imperative hybrid. These are vast simplifications but useful to start a conversation
126.
by ky3 12y ago
> Scheme is not a pure functional language I think OP wittily conflates 2 senses of pure. Scheme is purely functional in the sense that it's _only_ functional, as opposed to a hybrid like Scala, as OP points out. But it's not p
127.
by ky3 13y ago
Commoditized sourcing for content marketing, aka hiring some fiverr to hurl some blogshit.
128.
Not Everything That Counts Can Be Counted – Quitting The Numbers Racket(http)
1 points by ky3 13y ago|0 comments
129.
Not Everything That Counts Can Be Counted(atamo.com)
2 points by ky3 13y ago|0 comments
130.
by ky3 13y ago
BTW, Haskell only has (bounded) parametric polymorphism. Don't confuse the two: Bounded = Ad-hoc = Haskell type-classes. Parametric = Universal = unconstrained type variables. E.g. of parametric polymorphism: fst :: (a,b) -> a E.g
131.
by ky3 13y ago
Reminds me of: "In the voyeurism of Reality TV, the viewer's passivity is kept intact, pampered and massaged and force-fed Chicken McNuggets of carefully edited snippets that permit him or her to sit in easy judgment and feel superior at wa
132.
by ky3 13y ago
Neato, thanks! http://en.wiktionary.org/wiki/%E5%90%9B%E5%AD%90%E6%8A%A5%E4... "A nobleman bides his time for the perfect moment for revenge." I swear I didn't make up the oedipalia! A chinese native mentioned it in passing years ago and
133.
by ky3 13y ago
three YEARS Persistence, man, persistence. The chinese have some saying that, loosely translated, "ten years is short to revenge a father's death."
134.
by ky3 13y ago
Is it even an algorithm though? It's so imprecise a rule of thumb that evaluating it as a failure or a success is utterly arbitrary.
135.
by ky3 13y ago
Not all guesswork is dignified by the term conjecture though. Part of math school is to learn making and breaking guesses about things mathematical. As noted elsewhere ITT, a conjecture becomes one when there's a community-acknowledged
136.
by ky3 13y ago
One way of telling the story is this: as we keep traversing ever larger numbers, we can always find a pair of primes whose distance is less than 70 million. The twin primes conjecture holy grail is this: no matter how big we go, we can alwa
137.
by ky3 13y ago
And the second group is probably not empty. We know for sure it's non-empty by simple factorial arguments ITT or by appeal to the prime number theorem.
138.
by ky3 13y ago
And just to make sure one is not at some local optimum, it's not so much the names on the front page. Read papers the way experts do: from the biblio!
139.
by ky3 13y ago
It also has a much more powerful, but also more complex type system. To be precise, it's type _inference_ of Damas-Hindley-Milner + Typeclasses that poses the most gotchas. (Plain vanilla DHM is just ML. You can hack Haskell without class
140.
by ky3 13y ago
It seems like multiplication is just an extension of addition. How many times do you want to add numbers together? The result is multiplication. Similarly, addition can be used to represent multiplication. You want to multiply, which can b
141.
by ky3 13y ago
I think this is a cool project, but surely needs more of a preamble? Like what are crit-bit trees? [1,2,3,4] [1] http://benlynn.blogspot.com/2007/04/trees-hash-tables-and-tr... [2] http://en.wikipedia.org/wiki/Radix_tree [3] http://cr.
142.
by ky3 13y ago
Thanks everyone! The clear signal is: Run for the hills!
143.
by ky3 13y ago
But, I couldn't install it because it depends on the curl library and the curl library depends on linux binaries. I develop on Windows. There's a curl binary for Windows that uses cygwin. I had no problems developing Windows haskell apps
144.
by ky3 13y ago
Grammar doesn't come into this. A phonetic reading renders intended meaning without grammar flaws.
145.
by ky3 13y ago
The nymic proximity may be intentional. Haswell will be the first generation to support transactional memory [1]. [1] http://arstechnica.com/business/2012/02/transactional-memory...
146.
by ky3 14y ago
Check out Amy Hoy [1] and Don Lancaster [2]. Both place strong stress on "manageability by one person" and avoiding outside investments/interference. Two lesser-known conferences with previous-year videos online are LessConf and MicroConf.
147.
by ky3 14y ago
Good catch! It's the 3x BLAS that's 1/2 of Haskell's speed. The 1x BLAS that uses 2x RAM gets shafted, presumably by cache lossage.
148.
by ky3 14y ago
There are 2 pieces of C benchmarked. The other one computes `a[i]-b[i]` into a temporary array and then makes a single call to BLAS. The speed is roughly half that of Haskell, which dispenses with the space cost of the temporary array.
149.
by ky3 14y ago
Have you tried running hlint?
150.
by ky3 14y ago
We need to teach the highly educated man that it is not a disgrace to fail and that he must analyze every failure to find its cause. -- Charles Kettering When hacking tech, this kind of failure analysis happens all the time. In fact, it's

More ›