3 Matching Annotations
  1. 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.
  2. Oct 2020
  3. Aug 2015
    1. deterministic

      Is appropriate the use of a deterministic model here? It seems to me that it will be less accurate than a probabilistic one, and that that could influence the results of the comparison of the different aggregation levels biasing the conclusions.

    Tags

    Annotators