Live data from Hacker News

Viewing profile — davidgrenier

davidgrenier

HN member
Joined
Sat, Apr 26, 2014, 11:52 AM UTC
HN karma
388
Public activity
269 items

About davidgrenier

No profile information was provided.

Recent public activity

  1. comment
    Comment #48488692

    I think he's talking about company enshittification because of marke pressure, and not direct fraud though I haven't read the book.

  2. comment
    Comment #47973232

    Yeah I guess two companies who would otherwise be considered going for bankruptcy have models too expensive to run. As they don't see themselves making money any time soon, they ha…

  3. comment
    Comment #47501014

    I wonder how gracefully redgrep handles this. This tool hasn't been talked about since the year of its release. If I recall correctly, it doesn't handle some obstruse regexes the w…

  4. comment
    Comment #43514724

    There's only one "other side" in this, it's the American people.

  5. comment
    Comment #42736641

    v4l2-ctl on linux allows me to change such settings on a global level, maybe that might work if a version can be found on his OS.

  6. comment
    Comment #42682576

    I think the author is generous in granting that Caro-Cult programming works.

  7. comment
    Comment #42558181

    I haven't looked at Hardy's but the presentation in Spivak is also Dedekind cuts. Perhaps Hardy uses a different approach and OP misnamed it? Rudin's chapter 1 annex also use Dedek…

  8. comment
    Comment #42558154

    Where we define the real numbers as the least upper bounds of special sets. There is a bijection between these sets and the set of real numbers which we commonly think of and that …

  9. comment
    Comment #40774675

    Your very last example kinda supports the thesis up there, considering how it's been going.

  10. comment
    Comment #39189195

    Correct me if I'm wrong but (log n)^O(n) sounds like atrocious complexity?

  11. comment
    Comment #39189145

    LP or ILP? There is a significant difference since for non-discrete problem Linear Programming is shockingly efficient and in no way can be considered a brute force technique. edit…

  12. comment
    Comment #38568108

    I was speculating two oscillators with periods p and q could be composed (as long as there was no way for them to interact) to create an oscillator of period p*q/gcd(p,q) but wonde…

  13. comment
    Comment #37341098

    I think his argument was restricted to a human-produced mathematical result being ported to a Lean program where one would be just as likely to commit a mistake. However I disagree…

  14. comment
    Comment #37340784

    Good teacher, his Number Theory book felt really good though I have no comparable in Number Theory. I must say Number Theory and Combinatorics are the most difficult topics I got a…

  15. comment
    Comment #37021692

    Bouty makes excellent chair. Looking at their website I'm thinking Arista/Kadera/Fira. The model of chair I have doesn't seem front page but it is the Sity 9002. The piston gave af…

  16. comment
    Comment #36918866

    It isn't though: https://github.com/mrLSD/riscv-fs/blob/fa039b123ded9fa0c05d0...

  17. comment
    Comment #36918838

    I think this qualifies? https://en.wikipedia.org/wiki/MMIX#Simulators_and_assembler

  18. comment
    Comment #36918813

    My understanding of this is that it is an emulator that is meant to be very clear to read.

  19. comment
    Comment #36905092

    Someone mentionned in the Mastodon thread that they have an Android phone with nothing-from-google on it. I speculate his installation is even more responsive than whatever default…

  20. comment
    Comment #36861060

    Note that lightweight threads (even in CSP style concurrency model) can be even lighter and faster. F#'s Hopac library seems to meet such expectations with this simple program: #r …

  21. comment
    Comment #36707361

    But isn't what makes numpy efficient written in C?

  22. comment
    Comment #36572477

    Will double check both systems I have access to, thanks.

  23. story
    People running Windows 11, are you all running Sluggish Incarnate?

    I ask because every family member's system I sat next to has been, by my standards, unusably slow. At least 3 minutes boot time, then 1 minute spinning and another for icons to sho…

  24. comment
    Comment #36324088

    This looks brutal, for a lot of people John Reppy's book Concurrent Programming in ML (as in SML not Machine Learning) is going to be much more accessible. Pick the CSP-style libra…

  25. comment
    Comment #36269443

    Pro-tip, F# has an extremely efficient CSP-style concurrency library called Hopac.