13 Matching Annotations
  1. Jan 2024
  2. Feb 2022
  3. Jul 2021
  4. Feb 2021
    1. the 2 hardest problems in computer science are essentially the 2 hardest problems of life in general, as far as humans and information are concerned.
    2. 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.
    3. I like the answers already given, but I think they both could use an even more top-level, generalized explanation.
    4. Cache invalidation is hard because: Everything in life we want to know, changes.Those changes are non-deterministic.
  5. Aug 2020
  6. Apr 2020
  7. Jan 2020
    1. You can also fit generalized additive models (Chapter @ref(polynomial-and-spline-regression)), when linearity of the predictor cannot be assumed. This can be done using the mgcv package:
  8. Jan 2017