On Sat, Apr 15, 2017 at 12:25 AM, Ken Kahn <[email protected]> wrote:
> I would have thought the differences in speed are just the basic fact > about conjunctions that when the first conjunct is false the second need > not be computed. > Yes > So depending upon the cost of executing each conjunct and the probability > that the first conjunct will be false there is an optimal order. But the > paper's explanation sounds like 'with' looks to see if the predicate is a > conjunction and computes the first example as if it were written turtles > with [distance myself < 20] with [color = red]. Is this really the case? > No -- You received this message because you are subscribed to the Google Groups "netlogo-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/d/optout.
