Activity

Yes, my understanding is that the standard sense of tractable, for some algorithm, is: can be executed in time that grows at worst by a polynomial function of the input size. This is the sense I mean. The fixed task would be: create a given explanation in the space of all possible explanations.

Implementations of a given algorithm can be way more or less efficient in practice, though. Maybe personhood does require intractable algorithms, but ones which only ever run with small inputs... The question of the bounty is whether can we make a case for or against this. But part of the hope is also to learn if this whole framing is mistaken.