Motivic Information
classification
🧮 math-ph
math.MP
keywords
informationlossmeasuresmotivicanalogsappropriateassociatedcharacterize
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.