Live data from Hacker News

Viewing profile — oskarkv

oskarkv

HN member
Joined
Tue, May 04, 2010, 7:37 PM UTC
HN karma
28
Public activity
42 items

About oskarkv

No profile information was provided.

Recent public activity

  1. comment
    Comment #17026570

    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, s…

  2. comment
    Comment #9323092

    Is thinking obsolete too?

  3. comment
    Comment #8668128

    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 mo…

  4. comment
    Comment #7987650

    I was interested until I noticed it was pay-to-win. Instantly closed the tab.

  5. comment
    Comment #7753968

    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. comment
    Comment #7753924

    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))…

  7. comment
    Comment #7050791

    Yeah, only Lisp is beautiful. ;)

  8. comment
    Comment #6874462

    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 …

  9. comment
    Comment #6449121

    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. comment
    Comment #6112192

    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)) doe…

  11. comment
    Comment #6112151

    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. comment
    Comment #6097770

    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. comment
    Comment #5946560

    That's your biggest concern?

  14. comment
    Comment #5649538

    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 interes…

  15. comment
    Comment #4995783

    `for` is a macro, not a special form. Special forms are these: http://clojure.org/special_forms

  16. comment
    Comment #4958286

    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. comment
    Comment #4958273

    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…

  18. comment
    Comment #4816310

    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. comment
    Comment #4815799

    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 Li…

  20. comment
    Comment #4657830

    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 tha…

  21. comment
    Comment #4435256

    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(fu…

  22. comment
    Comment #4383622

    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. story
    Ask HN: Examples of Complecting

    I recently watched Rich Hickey's excellent talk Simple Made Easy http://www.infoq.com/presentations/Simple-Made-Easy/. After watching it I have noticed that a lot of tips I've hear…

  24. comment
    Comment #4214416

    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 f…

  25. comment
    Comment #3793030

    I think this book is very good. Lots of exercises and very clear. http://www.amazon.com/Discrete-Mathematics-Norman-L-Biggs/dp...