5 Matching Annotations
  1. Apr 2026
  2. Nov 2022
  3. Feb 2021
    1. The non-determinism is why cache invalidation — and that other hard problem, naming things — are uniquely and intractably hard problems in computer science. Computers can perfectly solve deterministic problems. But they can’t predict when to invalidate a cache because, ultimately, we, the humans who design and build computational processes, can’t agree on when a cache needs to be invalidated.
  4. Oct 2020
  5. Aug 2015

    Tags

    Annotators