Live data from Hacker News

Viewing profile — hakuseki

hakuseki

HN member
Joined
Thu, Dec 24, 2020, 12:57 AM UTC
HN karma
106
Public activity
65 items

About hakuseki

No profile information was provided.

Recent public activity

  1. comment
    Comment #45380857

    Leaving aside the question of whether the universe is discrete or continuous, a simulation would still have lower "resolution" than the real world, and some information can be lost…

  2. comment
    Comment #42323497

    The article is about (position, move) pairs. Why not call these objects "steps"?

  3. comment
    Comment #41099199

    In what sense is looking at a screen a failure to prepare for the world that adults navigate? Adults also look at screens.

  4. comment
    Comment #39638783

    > However, even using extra hardware wasn't enough in this case. So they pre-calculated lookup tables for sine, cosine, tangent etc. for every angle at the necessary precision. Is …

  5. comment
    Comment #39271282

    Are you planning to decelerate by crashing into the planet at relativistic speed?

  6. comment
    Comment #38539609

    I guess you mean k log k, not n log n.

  7. comment
    Comment #38500240

    What's so difficult about optical links from deep space compared to low earth orbit, where 200 gigabit throughput has been achieved? Is it just the attenuation? I would have imagin…

  8. comment
    Comment #38272771

    That is not strictly true. The weather at time t0 may affect non-weather phenomena at time t1 (e.g. traffic), which in turn may affect weather at time t2. Furthermore, a predictive…

  9. comment
    Comment #37910974

    > there is nothing in principle stopping us from running this machine for BB(748) steps How would we compute the value of BB(748)?

  10. comment
    Comment #37433231

    So to summarize, the game tree complexity is estimated by estimating the branching factor and the game length, and raising the former to the power of the latter. I find it slightly…

  11. comment
    Comment #37430139

    How were these numbers arrived at?

  12. comment
    Comment #37031094

    Seems like no collision is detected if you move the ball through the cloth fast enough.

  13. comment
    Comment #36874281

    ISTM that's just an a priori feeling. The value or lack thereof of the product totally depends on how accurately it predicts human survey responses, which you can't know without lo…

  14. comment
    Comment #36493247

    I think a median rating of 5 stars makes sense for a taxi service. You want the rating system to be able to express varying levels of bad. There are many levels of bad outcomes for…

  15. comment
    Comment #36266179

    I am not a vision expert, but simply matching the resolution of your display to the resolution of your sensor wouldn't necessarily produce a clear image, unless the pixels are alig…

  16. comment
    Comment #36019321

    The `find_item` example uses List for an argument. To my thinking, this indicates that the function is intended to mutate the argument. I don't think that was the author's intentio…

  17. comment
    Comment #35798162

    > It seems to me all we need here is a measure of confidence for the result averaged over the entire answer. Low confidence is a guess/hallucination. Even if the model knows the ex…

  18. comment
    Comment #35567263

    > Like any good mystery, the fun was in the build up and as we move towards a resolution there's a bitter sweet aspect to the slightly mundane reality of it 'merely' being an emerg…

  19. comment
    Comment #35091311

    This is just a guess, but I don't think there's such a deep lesson here; language models and image models have simply been developed by mostly-different groups of researchers who c…

  20. comment
    Comment #34256726

    I'm not sold on the concept of AI-hard or AI-complete problems. For example, the Wikipedia article on AI-completeness mentions Bongard problems and Autonomous driving as examples o…

  21. comment
    Comment #34034408

    This seems not quite right to me. A Turing machine may always halt, but with time depending on its input size. The input can be arbitrarily large, so there's no finite bound on the…

  22. comment
    Comment #34018728

    A small latitude difference does not imply that you can ignore curvature. I am just guessing, but perhaps your intuition is that the shortest path should lie along a line of latitu…

  23. comment
    Comment #33995355

    I think that's not a bad summary, though? Perhaps you would say it is a probabilistic next-token chooser, but that just seems like a very minor distinction.

  24. comment
    Comment #33828441

    Assuming all values are unequal, there are n factorial (abbreviated n!) possible cases that we need to distinguish. If we are sorting by comparison, then each comparison will elimi…

  25. comment
    Comment #33798846

    Might it have been Glory Season?