X user @_achan96_: partial identification bounds for tasks longer than 8 hours are narrower than for short tasks, or such tasks are easier to automate
X user @_achan96_ observed that in the method under discussion, the partial identification bounds for tasks longer than 8 hours are much narrower than those for short tasks; in his understanding, this means that judging whether a task longer than 8 hours succeeded is easier than judging a short task. On this basis he raised the question: does this make tasks longer than 8 hours more verifiable and easier to automate, or is it merely some property of the method itself.
It's pretty interesting that the partial identification bounds for 8+h tasks are way narrower than the bounds for shorter tasks
If I understand the methodology correctly, that means it's way easier to judge whether an 8+h task succeeds than whether a shorter task succeeds
Does that mean that 8+h tasks are more verifiable and hence easier to automate? Or maybe it's just some quirk of the methodology?