Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
oskarkv
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
6 ms
·
1.
▲
by
oskarkv
8y ago
True, but I am convinced that meditation can lead to awakening, which, apparently, involves the cessation of suffering and feeling one with the universe. It's not so far fetched, since our experience is generated by our brains, and sim
2.
▲
by
oskarkv
11y ago
Is thinking obsolete too?
3.
▲
by
oskarkv
12y ago
It really is readable, to me at least. I just wanted to say that because some people will perhaps read your comment and take it as true, because they too struggle with it at the moment, and then discard Clojure. But I'm just in love
4.
▲
by
oskarkv
12y ago
I was interested until I noticed it was pay-to-win. Instantly closed the tab.
5.
▲
by
oskarkv
12y ago
No. I love it. It's so simple. Even if Haskell has pretty nice syntax, I found myself resenting it because I needed to remember operator precedence.
6.
▲
by
oskarkv
12y ago
For very simple cases there are the threading macros, `->` et al., that you can use like this: (-> state (assoc :a val) (update-in [:b :c] f args) (dissoc :d) (some-other-fn args)) where :a - :d are k
7.
▲
by
oskarkv
13y ago
Yeah, only Lisp is beautiful. ;)
8.
▲
by
oskarkv
13y ago
Big O is not necessarily about execution time. Also, why is it ridiculous to describe execution time as "time complexity"? From http://en.wikipedia.org/wiki/Analysis_of_algorithms "Usually, the efficienc
9.
▲
by
oskarkv
13y ago
Branching factor 32 is great for lookups, but isn't it slower for modification? At least, one has to create more array cells in total (31 copies in each node), no?
10.
▲
by
oskarkv
13y ago
First of all, O(g(n)) is a set. It is the set of functions f(n) such that there exists positive constants n0 and C, and C*g(n) > f(n) when n > n0. Second, talking about O(g(n)) does not imply that the time complexity being discussed i
11.
▲
by
oskarkv
13y ago
Of course O(n) is not equal to O(n^2). O(n) is a set, and O(n^2) is a different set.
12.
▲
by
oskarkv
13y ago
He says he understood the power of Lisp, yet he made a non-Lisp language. :P I don't get people who make non-Lisp languages.
13.
▲
by
oskarkv
13y ago
That's your biggest concern?
14.
▲
by
oskarkv
13y ago
Does Chicken have immutable data structures? How about typeclasses/protocols? How about literal syntax for hash maps, sets, vectors/arrays? I'm coming from Clojure, and I'm interested in Chicken. I really like the things mentioned above abo
15.
▲
by
oskarkv
14y ago
`for` is a macro, not a special form. Special forms are these: http://clojure.org/special_forms
16.
▲
by
oskarkv
14y ago
I don't know what you mean by widespread. But work on it does not seem to be slowing down, and it is a really good language, so I think it will only grow.
17.
▲
by
oskarkv
14y ago
There is a lot of stuff in Clojure that can be done in more than one way. I know that Python focuses on "only one way to do it", but Clojure's focus is on simplicity, as defined by Rich Hickey in Simple Made Easy [1], and that is a much bet
18.
▲
by
oskarkv
14y ago
Yeah, I know about it, but it's an additional dependency, right? [org.clojure/core.logic "0.7.5"] Whatever, Clojure is clean and simple is what I wanted to say. :)
19.
▲
by
oskarkv
14y ago
Your comment gives the impression that Clojure is a big multiparadigm mess. But it is not. Clojure's design is clean and simple. Clojure is mostly functional. Sure, since it's a Lisp one can kind of incorporate other paradigms with macros.
20.
▲
by
oskarkv
14y ago
The correct statement about lower bounds is this: "In the worst case, any comparison based sorting algorithm must make Ω(n log(n)) comparisons." You are making the same mistake that people that have Misconception 1 make. "The algorithm mu
21.
▲
by
oskarkv
14y ago
As far as I have understood, this is just regular memoization. I mean, often in functional languages one just turns a regular function into a memoized version by calling memoize(function). Sometimes that works to create a function that does
22.
▲
by
oskarkv
14y ago
If you found this interesting and have not tried Clojure yet, you should really give it a go. Learning Clojure teaches a lot about programming just because it is very well-designed.
23.
▲
Ask HN: Examples of Complecting
1 points
by
oskarkv
14y ago
|
0 comments
24.
▲
by
oskarkv
14y ago
I have heard many people complain about the documentation (in fact I've seen you do it before ;)). But I think the documentation is great; concise and informative. I learned more from the docs (the reference) on clojure.org than any book.
25.
▲
by
oskarkv
14y ago
I think this book is very good. Lots of exercises and very clear. http://www.amazon.com/Discrete-Mathematics-Norman-L-Biggs/dp...
26.
▲
by
oskarkv
15y ago
I particularly like this page: http://clojuredocs.org/quickref/varsonly/Clojure%20Core
27.
▲
by
oskarkv
15y ago
A couple of questions about Vundle. What about plugins that are not in a git repo (but a hg repo)? What if I don't want the lastest version of a plugin?
28.
▲
by
oskarkv
15y ago
From the article: "I was trying to memorize equations..." That's doing it wrong. I agree with you that math education is probably broken. I imagine that math is very boring if memorizing equations is what you are doing.
29.
▲
by
oskarkv
15y ago
I will say that the online documentation IS atrocious and basically impenetrable... Maybe it's just me, but I find the documentation to be very good. Everything on clojure.org is relevant, clear and concise. I read two books too, but I
30.
▲
by
oskarkv
15y ago
This is kind of interesting. Where does your thoughts come from? If I asked you to think of a famous person, and say the first person that comes to your mind, what determines whom you will think of? Presumably you were not thinking of a per
More ›