Comment

Comment by crdrost

> Infinite sums are rather inconvenient to calculate in finite time, although this one does converge to a finite value since the terms become exponentially smaller. We could compute until the terms because small enough for an approximation, but that would be unsatisfactory when an exact solution is possible. The key insight is that it doesn’t matter how many times a given item has already been through the loop, only what quality tier it has now.

Isn't the matrix

    M = 1 + L + L^2 + ...

    M = (1 - L)^-1
...? L isn't invertible, but 1 - L is.
parent crdrost 1 month ago

No comments yet

Be the first to share your thoughts.

Live from the official Hacker News API

A modern reader for Hacker News · SvelteKit + Skeleton