‹ BackHN Continuity

Thread

Yes, Claude can do nine loops

103 points · 62 comments · tzury

  1. atemerev · · focus · HN ↗
    Just recently I used Fable 5.1 and Astra to solve and prove a long-standing mathematical problem I was always interested in: the shoreline search problem (a ship in total fog is at unknown distance from the shore [infinite line], what is the optimal trajectory?) A particular kind of logarithmic spiral was conjectured 33 years ago; a few days ago, I have obtained the proof. How routine it has become.

    <a href="https:&#x2F;&#x2F;arxiv.org&#x2F;abs&#x2F;2609.24454" rel="nofollow">https:&#x2F;&#x2F;arxiv.org&#x2F;abs&#x2F;2609.24454

    1. onlyrealcuzzo · · focus · HN ↗
      What if the shore isn&#x27;t a clean line?
      1. atemerev · · focus · HN ↗
        Then it is the <a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Bellman%27s_lost-in-a-forest_problem" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Bellman%27s_lost-in-a-forest_p... - also unsolved
Open on Hacker News to reply ↗

Unofficial Hacker News client; not affiliated with Y Combinator.