Claude Shannon’s acceptance speech “Development of Communication and Computing, and my Hobby”
A nice history can be found in
Fienberg, Stephen E. (2006). “When Did Bayesian Inference Become “Bayesian”?”. Bayesian Analysis 1 (1): 1–40.
Please add your name to the petition list:
Update (4/3/2014): I believe I have solved the conjecture, and proven it to be correct.
I will make a preprint available shortly(see link below). The original blog post remains available below. — Tom
Preprint available here: “An extremal inequality for long Markov chains“.
I have an extremal conjecture that I have been working on intermittently with some colleagues (including Jiantao Jiao, Tsachy Weissman, Chandra Nair, and Kartik Venkat). Despite our efforts, we have not been able to prove it. Hence, I thought I would experiment with online collaboration by offering it to the broader IT community.
In order to make things interesting, we are offering a $1000 prize for the first correct proof or counterexample! Feel free to post your thoughts in the public comments. You can also email me if you have questions or want to bounce some ideas off me.
Although I have no way of enforcing them, please abide by the following ground rules:
- If you decide to work on this conjecture, please send me an email to let me know that you are doing so. As part of this experiment with online collaboration, I want to gauge how many people become involved at various degrees.
- If you solve the conjecture or make significant progress, please keep me informed.
- If you repost this conjecture, or publish any results, please cite this blog post appropriately.
One final disclaimer: this post is meant to be a brief introduction to the conjecture, with a few partial results to get the conversation started; it is not an exhaustive account of the approaches we have tried.
1. The Conjecture
2. Partial Results
There are several partial results which suggest the validity of Conjecture 1. Moreover, numerical experiments have not produced a counterexample.
Conjecture 1 extends the following well-known consequence of the conditional entropy power inequality to include long Markov chains.
Proof: Consider any satisfying . Let denote the random variables conditioned on . By Markovity and definition of , we have that , where is independent of . Hence, the conditional entropy power inequality implies that
From here, the lemma easily follows.
For every , the variables are jointly Gaussian with correlation coefficient and form a Markov chain, hence Lemma 1 implies
The desired inequality (8) follows by convexity of
as a function of .
3. Equivalent Forms
Alternatively, we can consider dual forms of Conjecture 1. For instance, one such form is stated as follows:
Conjecture 1′. Suppose are jointly Gaussian, each with unit variance and correlation . For , the infimum of
taken over all satisfying is attained when are jointly Gaussian.
including Claude E. Shannon Award winner Sol Golomb
Nominations of people born on or after January 1, 1974
for outstanding contributions in Mathematical Aspects of Information Sciences including:
- All mathematical aspects of computer science, including complexity theory, logic of programming languages, analysis of algorithms, cryptography, computer vision, pattern recognition, information processing and modelling of intelligence.
- Scientific computing and numerical analysis. Computational aspects of optimization and control theory. Computer algebra.
Nomination Procedure: http://www.mathunion.org/general/prizes/nevanlinna/details/