Probability and program-size for functions

Gregory Chaitin

Paper

24 Jul 2006

Probability and program-size for functions

Abstract

We show that unlike the general case of the relationship between algorithmic probability and program-size for enumerating sets, in the case of the graphs of total functions these two quantities are closely related.

Paper

A minimal descriptor of an ancestral recombinations graph

Laxmi Parida, Pier F. Palamara, et al.

BMC Bioinformatics

Paper

The classification of one-sided Markov chains

Jonathan Ashley, Brian Marcus, et al.

Ergodic Theory and Dynamical Systems

Paper

Efficient Heuristics for Orientation Metric and Euclidean Steiner Tree Problems *

Y.Y. Li, K.S. Leung, et al.

J Combin Optim

Paper

Best L¹ approximation by weak chebyshev systems and the uniqueness of interpolating perfect splines

Charles A Micchelli

Journal of Approximation Theory

View all publications

Abstract

Related

A minimal descriptor of an ancestral recombinations graph

The classification of one-sided Markov chains

Efficient Heuristics for Orientation Metric and Euclidean Steiner Tree Problems *

Best L1 approximation by weak chebyshev systems and the uniqueness of interpolating perfect splines

Best L¹ approximation by weak chebyshev systems and the uniqueness of interpolating perfect splines