  In 1952 Lucien Le Cam announced his celebrated result that, for regular
univariate statistical models, sets of points of superefficiency have Lebesgue
measure zero. After reviewing the turbulent history of early studies of
superefficiency, I suggest using the notion of computability as a tool for
exploring the phenomenon of superefficiency. It turns out that only computable
parameter points can be points of superefficiency for computable estimators.
This algorithmic version of Le Cam's result implies, in particular, that sets
of points of superefficiency not only have Lebesgue measure zero but are even
countable.
