2 ms·
I hear you, I do. But it irks me when people wave this stuff around like a magic wand, because it's just not. It's like saying you have an O(1) solution to all
by jacques_chester 10y ago
I hear you, I do. But it irks me when people wave this stuff around like a magic wand, because it's just not.
It's like saying you have an O(1) solution to all TSP graphs with the teeny, tiny caveat that you start with a solution to the TSP graph you're working on.
- naasking 10y agoI still think your last statement is unfair. At worst, the caveat is that the TSP solution is for any graph within a certain class of topologies. Concurrent revisions in particular has been implemented to work in concurrent, parallel and incremental computing, with no change in semantics. So it's pretty darn close to a magic wand, but it can't violate the laws of logic.