  We introduce notions of information/entropy and information loss associated
to exponentiable motivic measures. We show that they satisfy appropriate
analogs to the Khinchin-type properties that characterize information loss in
the context of measures on finite sets.
