Hypothesis Selection and Testing by the MDL Principle.
- Published in:
- Computer Journal, 1999, v. 42, n. 4, p. 260, doi. 10.1093/comjnl/42.4.260
- By:
- Publication type:
- Article
Works matching IS 00104620 AND DT 1999 AND VI 42 AND IP 4
Results: 16
1
2
Minimum Message Length and Kolmogorov Complexity.
- Published in:
- Computer Journal, 1999, v. 42, n. 4, p. 270, doi. 10.1093/comjnl/42.4.270
- By:
- Publication type:
- Article
3
Two Kinds of Probabilistic Induction.
- Published in:
- Computer Journal, 1999, v. 42, n. 4, p. 256, doi. 10.1093/comjnl/42.4.256
- By:
- Publication type:
- Article
4
Rejoinder.
- Published in:
- Computer Journal, 1999, v. 42, n. 4, p. 345, doi. 10.1093/comjnl/42.4.345
- By:
- Publication type:
- Article
5
Rejoinder.
- Published in:
- Computer Journal, 1999, v. 42, n. 4, p. 343, doi. 10.1093/comjnl/42.4.343
- By:
- Publication type:
- Article
6
Discussion on Kolmogorov Complexity and Statistical Analysis.
- Published in:
- Computer Journal, 1999, v. 42, n. 4, p. 340, doi. 10.1093/comjnl/42.4.340
- By:
- Publication type:
- Article
7
Discussion of the Papers by Rissanen, and by Wallace and Dowe.
- Published in:
- Computer Journal, 1999, v. 42, n. 4, p. 338, doi. 10.1093/comjnl/42.4.338
- By:
- Publication type:
- Article
8
Refinements of MDL and MML Coding.
- Published in:
- Computer Journal, 1999, v. 42, n. 4, p. 330, doi. 10.1093/comjnl/42.4.330
- By:
- Publication type:
- Article
9
Discussion of paper ‘Minimum Message Length and Kolmogorov Complexity’ by C. S. Wallace and D. L. Dowe.
- Published in:
- Computer Journal, 1999, v. 42, n. 4, p. 327, doi. 10.1093/comjnl/42.4.327
- By:
- Publication type:
- Article
10
Discussion of the Papers by Rissanen and by Wallace and Dowe.
- Published in:
- Computer Journal, 1999, v. 42, n. 4, p. 323, doi. 10.1093/comjnl/42.4.323
- By:
- Publication type:
- Article
11
Complexity Approximation Principle.
- Published in:
- Computer Journal, 1999, v. 42, n. 4, p. 318, doi. 10.1093/comjnl/42.4.318
- By:
- Publication type:
- Article
12
Algorithmic Complexity and Stochastic Properties of Finite Binary Sequences.
- Published in:
- Computer Journal, 1999, v. 42, n. 4, p. 294, doi. 10.1093/comjnl/42.4.294
- By:
- Publication type:
- Article
13
New Applications of the Incompressibility Method.
- Published in:
- Computer Journal, 1999, v. 42, n. 4, p. 287, doi. 10.1093/comjnl/42.4.287
- By:
- Publication type:
- Article
14
Robust Measures of Information.
- Published in:
- Computer Journal, 1999, v. 42, n. 4, p. 284, doi. 10.1093/comjnl/42.4.284
- By:
- Publication type:
- Article
15
Kolmogorov Complexity: Sources, Theory and Applications.
- Published in:
- Computer Journal, 1999, v. 42, n. 4, p. 252, doi. 10.1093/comjnl/42.4.252
- By:
- Publication type:
- Article
16
Special Issue Editorial: Kolmogorov Complexity.
- Published in:
- Computer Journal, 1999, v. 42, n. 4, p. 251, doi. 10.1093/comjnl/42.4.251
- By:
- Publication type:
- Article