kanak

10 ms·

61.
by kanak 16y ago
It's specially ridiculous when you consider the fact that as a grad student you are actually PAID to study (granted, it's not a huge amount, but the point remains). So essentially, I come here, get paid to study, learn from the best, and go
62.
by kanak 16y ago
> Education is a long term investment in the future and one that the US has being failing making for some time now. The treatment of foreign students is particularly perplexing. We come here, spend 4+ years learning at the best colleges
63.
by kanak 16y ago
No. Joking aside, this is pretty cool.
64.
by kanak 16y ago
This is definitely a problem with R, although the biggest problem IMO is that a lot of libraries aren't multicore capable. Fixing the memory problem was just a matter of adding lots of ram into our workstation, we can't fix the "can't use m
65.
by kanak 16y ago
I guess R is a bit more DIY than these frameworks, but it has a very large collection of tools. I've found libraries for everything from CART (classification and regression trees), to SVM, to HMM learning, to clustering, to EM. R with libra
66.
by kanak 16y ago
The Scheme Programming Language now has a 4th Edition: http://www.scheme.com/tspl4/
67.
by kanak 16y ago
There's also a nice comment by Sam Madden (professor at MIT, teaches classes on databases) below. It is a nice response to the person who essentially said "Mike is in theory, Matt is in systems so their experiences are not comparable.
68.
by kanak 16y ago
Sorry but do you have sources to back up your assertion? I took a class with Prof. Sussman, and even worked as an undergraduate researcher for a summer, and I know for a fact that his current work is still being done in MIT Scheme. The clas
69.
by kanak 16y ago
Could you recommend some resources for learning BDD?
70.
by kanak 16y ago
Wow that's almost the same as scheme. Here's the scheme version of the above code: Your example would be translated as: (lambda (a b) (+ a b)) ;; making an anonymous function (define add (lambda (a b) (+ a b))); ;; calling the anonymous fun
71.
by kanak 16y ago
Here's a blog post by Yaron describing the talk: http://ocaml.janestreet.com/?q=node/75
72.
by kanak 16y ago
Last semester, I took a class with Prof Gerry Sussman (of SICP fame). It was totally mindbending, and seeing his code samples (usually introduced by saying "I was hacking on this last night...") left me with a sense of awe and amazement. I
73.
by kanak 16y ago
> It seems a little quick to me. 9 months would be better (though irregular) in my opinion. Doesn't OpenSUSE have a 9 month schedule?
74.
by kanak 16y ago
> You can never know in advance what you will need, and chance favors the prepared mind. I agree with you fully. It's surprising how useful things from unrelated fields can be. Just as an example, taking a course on economics taught me
75.
by kanak 16y ago
To this excellent list I'd add: First Class Continuations like in Scheme.
76.
by kanak 16y ago
> Is learning LaTeX anywhere near as useful to a professional developer as say learning vim or emacs? I would say no (even though I use latex nearly every single day). On the other hand, it is indispensable if you're doing maths or anyt
77.
by kanak 16y ago
No it doesn't. (I use linux on a lenovo)
78.
by kanak 16y ago
I tried it on google reader ( http://reader.google.com ) and most of the top matches are google reader itself. It worked better on reddit.com though.
79.
by kanak 16y ago
> Let's face it - it's not the language that is the problem. It would help you, but it would help you only with some percentage of the problems out there. Let's not underestimate the help that a language can provide; writing interpreter
80.
by kanak 16y ago
> it's all implemented in terms of macros This is not true at present. The core data structures, and the STM machinery are implemented in java, not as macros.
81.
by kanak 16y ago
> a smart work splitting algorithm Not to detract from anything you said (which I agree with), but when Guy Steele gave a guest lecture at my university on Fortress a few months ago, he said that the work splitting algorithm still neede
82.
by kanak 16y ago
Sorry if i wasn't being clear. I mean problems that remain undecidable even when you have an oracle for the Halting Problem.
83.
by kanak 16y ago
> why not go further, and conjecture that the brain can solve problems that are uncomputable even given an oracle for the halting problem Can anyone give me an example of such problems?
84.
by kanak 16y ago
I took a theory of computation class with Prof. Aaronson and this brought back some fond memories. I like the fact that he's formal when he needs to be, but doesn't shy away from using simple "real-life" examples when he can. Think about ho
85.
by kanak 16y ago
> "It's a bit awkward as a fully standalone language, since things like IO don't always mix with backtracking. It's great as a rule engine, though, and would probably also be brilliant as a query language for a document-oriented databas
86.
by kanak 16y ago
Racket has a lazy module that can let you have lisp+laziness. There's also typed scheme which lets you do lisp+types. Now if only someone could make a lazy typed racket.
87.
by kanak 16y ago
I had a similar observation about haskell's pattern matching when I was learning haskell: " Built in pattern matching - it's very convenient about programming sometimes. Unfortunately for someone who learned Prolog before Haskell, Haskells'
88.
by kanak 16y ago
I like this idea a lot because it'll show them the value of thinking about the design and coming up with something that can be adapted and modified as new requirements come in. If you just do a series of unrelated challenges, then there won
89.
by kanak 16y ago
Could you please provide a link to the implementation? I'm really interested in learning how this is done. Thanks.
90.
by kanak 16y ago
Has this been done by someone? I remember the same answer (use Clojure + Terracotta) being given months ago when someone in the clojure google group asked for erlang type distribution support. I was wondering if someone had actually done it

More ›