Uncategorized
Universality: One Machine to Run Them All
A single machine, given the description of any other, can imitate it exactly.
Stories by Mahendra
Uncategorized
P Versus NP: The Boundary of the Feasible
Is finding a solution as easy as checking one? For a vast class of problems we can verify an answer quickly but know no fast way to discover it.
Uncategorized
Kolmogorov Complexity: The Length of the Shortest Description
The complexity of an object is the length of the shortest program that produces it.
Uncategorized
Minimum Description Length
The best theory is the one that, together with the data it explains, can be stated most briefly.
Uncategorized
Occam’s Razor: The Case for Simplicity
Faced with rival explanations that fit equally well, prefer the simpler.
Uncategorized
Mutual Information as a Measure of Relationship
How much does knowing one thing tell you about another? The question has a precise answer, a single number that captures dependence of any kind.
Uncategorized
Generative Versus Discriminative: Modeling the World or the Boundary
To tell cats from dogs, one can learn what separates them or learn what each is.
Uncategorized
Robustness Versus Accuracy
A model tuned to be right on average may be fragile to the unusual.