It looks like a self-adjusting computation, in the sense that Jane Street and the paper they refer to uses, is similar to functional reactive programming. It looks like you can create observable values, and create observable computations on those values. The dependency graph is dynamic, which it appears is the improvement here over other FRP designs?
Genetic algorithms are a different sort of thing, and I can see how "self adjusting computation" could be used to describe either.
Functional reactive programming is not usually incremental, while self adjusting computations are not usually reactive, which is why there isn't much overlap between the concepts. Of course, you are free to mix concepts from both as you need to.
Genetic algorithms are a different sort of thing, and I can see how "self adjusting computation" could be used to describe either.