Live data from Hacker News

Viewing profile — rak1507

rak1507

HN member
Joined
Thu, May 20, 2021, 3:11 PM UTC
HN karma
355
Public activity
195 items

About rak1507

uni student

Recent public activity

  1. story
  2. comment
    Comment #45941351

    You won't get anything from vapourware salesmen.

  3. comment
    Comment #45941343

    It seemingly takes a long time to write good software too, co-dfns is infinity+1 years in progress...

  4. comment
    Comment #45640835

    There's a difference between one line and short/terse/elegant. {m:(x,x)#til x*x; r:til[x]-x div 2; 2(flip r rotate')/m} generates magic squares of odd size, and the method is much …

  5. comment
    Comment #44242119

    There aren't really any complicated arguments being made, so I don't think a proof would be that involved.

  6. comment
    Comment #44236593

    You definitely don't need to know any of that background to be able to arrive at the answer. To fully understand everything maybe, but all it takes is: a = x^1 + x^4 + x^7 + ... = …

  7. comment
    Comment #44236317

    Why not? All that is really required is knowing 1/(1-x) = 1+x+x^2+... and a bit of algebraic manipulation.

  8. comment
    Comment #44199088

    Isn't referencing a source exactly the right way to go about pointing out someone is essentially lying about their background/credentials? I'm surprised people do not care about ac…

  9. comment
    Comment #44196825

    I remembered it, and it seems like a reasonable assumption that your first experience of APL being so bad would put you off doing any more in the future.

  10. comment
    Comment #44196586

    Most of it is boilerplate or written like it is Java, so it is pretty small compared to any real world projects. To me professional implies production/real world/paid work, not jus…

  11. comment
    Comment #44196375

    Well, you've said you used APL professionally, but judging by https://news.ycombinator.com/item?id=31368299 it was in a university project.

  12. comment
    Comment #44196228

    [flagged]

  13. comment
    Comment #43799973

    The append is the only thing that is O(1), finding the deletion mask is linear (≠ is linear, isn't it?) and the actual deletion is also linear (⌿ is also linear). ]runtime -repeat=…

  14. comment
    Comment #43797749

    The problem is that this isn't a "hashmap" in any meaningful sense, because all the operations are O(n).

  15. comment
    Comment #43015760

    When it comes to subjective opinions, what other choice do you have? Your idea of doing studies is interesting but that's not even been done for most languages, yet claiming "pytho…

  16. comment
    Comment #43008755

    I had a peek at your github profile, and noticed "sqlutilpy", "Python module to efficiently query SQL databases and return numpy arrays". K is like if a language just did that by d…

  17. comment
    Comment #43008712

    You have been talking about array languages on HN for at least 6 years, and still refuse to believe that anyone can read them! What do you have to gain from this stance, and why do…

  18. comment
    Comment #43008672

    Personally I think the best comparison would be Python+Pandas/polars+... or R+tidyverse+..., the key thing being there's less need for the "..." in a language with good table manip…

  19. comment
    Comment #42511657

    Do you mean f(x,n-1)^x or x^f(x,n-1)? With the first definition, c=1, the second, c=sqrt(2). I'm still not seeing the connection to omega.

  20. comment
    Comment #42505688

    What do you mean by x^x^x^... = 2? Isn't the solution to that sqrt(2)?

  21. story
  22. comment
    Comment #42292028

    I don't know if there's a specific k4 binary but you can run k4 through the q binary.

  23. comment
    Comment #42289660

    It's k4, the underlying language behind Q. With slight modifications it also runs in ngn/k which is FOSS. https://ngn.codeberg.page/k/#eJxVjsFugzAMhu95iiyWik1CIGPtIVG...

  24. comment
    Comment #42289446

    What's so hard about Day 12? It's just +/'{x:".",x;H:(-1+;1+i-)@'+|\m*i:!#m:x=\:"#." R:(x=x)({[h;d;x;y;z](z#0),+\(((-z)_~"#"=x)&z_d>z)*(*y),(-z+1)_y-0^y h}. H)[x]/y (*|R)-R@*|0,&1_…

  25. comment
    Comment #41806666

    Again, I'm not saying anything is impossible to do, it's just about whether or not it's worth it. 2 or 3 lines for all types for all overloads for all primitives etc adds up quickl…