# Ray Solomonoff

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Complexity
- 2017

Given the widespread use of lossless compression algorithms to approximate algorithmic (Kolmogorov-Chaitin) complexity and that… (More)

Is this relevant?

2012

2012

- Minds and Machines
- 2012

Independence of Conditionals (IC) has recently been proposed as a basic rule for causal structure learning. If a Bayesian network… (More)

Is this relevant?

2011

2011

- Algorithmic Probability and Friends
- 2011

We identify principles characterizing Solomonoff Induction by demands on an agent’s external behaviour. Key concepts are… (More)

Is this relevant?

2010

2010

- Algorithms
- 2010

Ray Solomonoff was always inventive. As a child, he had a lab in his parent's cellar in Cleveland and a secret air hole to vent… (More)

Is this relevant?

2010

2010

- ALT
- 2010

Finding the universal artificial intelligent agent is the old dream of AI scientists. Solomonoff Induction was one big step… (More)

Is this relevant?

2004

2004

- 2004

To defeat Gibbs phenomenon in Fourier and Chebyshev series, Gottlieb et al. [D. Gottlieb, C.-W. Shu, A. Solomonoff, H. Vandeven… (More)

Is this relevant?

2004

2004

- 2004

The concept of "pattern" is introduced, formally defined, and used to analyze various measures of the complexity of finite binary… (More)

Is this relevant?

1997

1997

- 1997

Solomonoff's induction method is an interesting theoretical model of what could be considered a perfect inductive inference… (More)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- FOCS
- 1990

Distributed NP (DNP) problems are ones supplied with probability distributions of instances. We can consider their hardness for… (More)

Is this relevant?

Highly Cited

1974

Highly Cited

1974

- 1974

This paper attempts to describe, in nontechnical language, some of the concepts and methods of one school of thought regarding… (More)

Is this relevant?