Live data from Hacker News

Viewing profile — svat

svat

HN member
Joined
Mon, Mar 16, 2009, 3:48 AM UTC
HN karma
8,918
Public activity
1,407 items

About svat

https://shreevatsa.net/

Recent public activity

  1. comment
    Comment #49215727

    I remember encountering NoDictionaries years ago, and love it. Thank you for building it!

  2. comment
    Comment #49173532

    This is a really nice presentation of how some people play the authors' lawn-moving game better than others -- a great analysis of the gameplay. But the majority of comments on thi…

  3. comment
    Comment #49164533

    This is such a surprising comment! Bradbury's style is very sparse and plain, and much closer to Hemingway's end of the spectrum than to the other. Where would you put, say, Naboko…

  4. comment
    Comment #48998863

    For OP: I think "Type specimen" should be the default sample text, just to get readers into the right spirit. :) For anyone else reading this: make sure you click on the "controls …

  5. comment
    Comment #48965448

    By your reasoning, multiplying two numbers in binary involves no multiplication at all, because multiplying by 1 and multiplying by 0 are both trivial operations. But obviously mul…

  6. comment
    Comment #48947083

    This is great! Loved the demo and controls (and nice touch to include The Frog Prince as one of the sample texts lol). I think by doing tracking and expansion you're going even fur…

  7. comment
    Comment #48915676

    > AI is a bad writer, but […] Let’s say they finally fixed the machine so it was really good, so its default setting was to write exactly like VS Naipaul. The result would be a wor…

  8. comment
    Comment #48785883

    No they are not, which is why Wikipedia doesn't rely on them. All information on Wikipedia is supposed to be verifiable via a reliable secondary source (books, newspapers, etc from…

  9. comment
    Comment #48782319

    I had to read your comment several times, because the quotes seemed to have nothing in common, let alone be "almost verbatim". Then I realized you were probably commenting not abou…

  10. comment
    Comment #48710662

    I think it's the latter. I find the introduction (written by Kent Beck) easier to understand than the rest of the article (which he says is AI-written: "genie-generated description…

  11. comment
    Comment #48699616

    X, who was Y, was stuck at Z the entire W. (Bruce Edgar), who was (on (102 not out)), was stuck at (the (non-striker's end)) the entire (over). • An “over” consists of six opportun…

  12. comment
    Comment #48654864

    To make the chronology clear: • The Wikipedia page from before the reference to Chen's article was added: https://en.wikipedia.org/w/index.php?title=Chip%27s_Challeng... — it cites…

  13. comment
    Comment #48483297

    This is cool, good luck with your project! For this page, you may want to pick as the default examples some longer words (like say "nevertheless") that show both positive (odd numb…

  14. comment
    Comment #48399611

    I think your second paragraph is the same as “so slowly”, just quantified. And I'd argue that the technical meaning of “almost all” does match the everyday definition: if you told …

  15. comment
    Comment #48399460

    I think by "have 32 bit factors" the GP actually means "has a factorization as a product of two 32-bit numbers", rather than the natural meaning that doesn't work, as you pointed o…

  16. comment
    Comment #48364099

    It's related, but not the same thing. For example, for b=10, the number 70=2x5x7 is b-smooth, but it cannot be written as the product of two numbers less than b. Here are the other…

  17. comment
    Comment #48364084

    The word “most” is indeed not very surprising if taken to mean >50% (as you do), but the surprising fact (admittedly not relevant for 2^64 in the quoted sentence) is that “most” ca…

  18. comment
    Comment #48345407

    See “The Concept of a Meta-Font”: https://gwern.net/doc/design/typography/1982-knuth.pdf

  19. comment
    Comment #48249098

    > But nearly all print publishers also do what SE does. Do they? To check, I tried to find a recent publication of Agatha Christie, and found the collection “Country Christie: Twel…

  20. comment
    Comment #48247637

    Your comment makes it sound as though the mistake was introduced by an inexperienced contributor who did not read the guide, when in fact it was introduced by the founder/editor-in…

  21. comment
    Comment #48243213

    An Applied Mathematician's Apology by Nick Trefethen[1] has a chapter (a couple of pages) titled "Cleve Moler and Matlab". > I first met Cleve Moler when I was a graduate student a…

  22. comment
    Comment #48227913

    Hi (looks like I've already starred your repo at some point months/years ago)! The motivation was not to replace art with technology, but to preserve/resurrect an art that was goin…

  23. comment
    Comment #48222643

    Actually: • He had already published the first editions of Volume 1, 2, 3, and the second edition of Volume 1, by 1973. It was in 1977 when the publishers sent him galley proofs fo…

  24. comment
    Comment #48216144

    I was hoping to reply to this in detail but as I never got around to it, I'll keep it short: mostly it's about the editorial changes they make to the text, modernizing spelling etc…

  25. comment
    Comment #48153262

    Have you considered having a detailed version history for each book (etext)? The process of submitting fixes to typos etc in books involves sending an email ( https://www.gutenberg…