I would be interested in any proof relating a formal link between the variational principle of minimum Fisher information and the incompleteness theorems.
I think of Fisher information as a measure of how much any one particular channel of information transmission can possibly describe some source phenomenon. In a sense, the Cramer-Rao bound provides a theoretical limit to how much can be known about the source phenomenon using any one particular information channel. You see why this makes me think of Goedel's theorems? Any one formal axiomatic system or language which is non-contradictory cannot prove all truths about something. In the same way that multi-sensor fusion works around the limitation imposed by Cramer-Rao bound (by increasing Fisher information... how much can be known about the source), multiple programming languages can be combined to prove more truths than any one language alone. -- You received this message because you are subscribed to the Google Groups "Everything List" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/everything-list. For more options, visit https://groups.google.com/d/optout.
