Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with it.information-theory
Search options not deleted
user 5963
Theoretical and experimental aspects of information theory and coding theory. This tag covers but is not limited to following branches: information theory, information geometry, optimal transportation theory, coding theory.
8
votes
What is the maximum entropy distribution on the natural numbers?
This follows (modulo any minor technical details I haven't checked) from the theory of exponential families. The main result there says that the distribution which maximizes entropy subject to constr …
- 8,501
10
votes
Existence of unknowable algorithms ?
The Robertson-Seymour graph minor theorem shows that membership in any given minor-closed family of graphs can be checked in polynomial time. It even shows this can be done in $\mathcal{O}(n^3)$ time …
- 8,501
3
votes
Do runtimes for P require EXP resources to upper-bound? ... are concrete examples known? (an...
I'm not entirely sure I understand your question, but you may be interested in the Robertson-Seymour Theorem. It shows that any family of graphs satisfying a certain property (being "minor-closed") h …
- 8,501