The discovery of algorithmic probability
type: Item
instance of: scholarly article
title: The discovery of algorithmic probability
zbMATH Open document ID: 1004.68525
author: Ray J. Solomonoff
published in: Journal of Computer and System Sciences
publication date: 1997-10-28T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1079982
MaRDI profile type: Publication
full work available at URL: jcss.1997.1500
OpenAlex ID: W2057728133
cites work: Q3288095
cites work: On the Length of Programs for Computing Finite Binary Sequences
cites work: A Theory of Program Size Formally Identical to Information Theory
cites work: Three models for the description of language
cites work: Q3198897
cites work: Q5507983
cites work: Q4074808
cites work: Q5668011
cites work: A Method for the Construction of Minimum-Redundancy Codes
cites work: Q3214803
cites work: Logical basis for information theory and probability theory
cites work: Q5681915
cites work: Q4071737
cites work: Q4070738
cites work: Q4023358
cites work: The definition of random sequences
cites work: Q5725167
cites work: Autonomous theory building systems
cites work: Modeling by shortest data description
cites work: Q3995624
cites work: A Mathematical Theory of Communication
cites work: Process complexity and effective random tests
cites work: A formal theory of inductive inference. Part I
cites work: A formal theory of inductive inference. Part II
cites work: Complexity-based induction systems: Comparisons and convergence theorems
cites work: An Information Measure for Classification
cites work: Computational Complexity and Probability Constructions
cites work: Fuzzy sets
cites work: THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
DOI: 10.1006/JCSS.1997.1500
description: scientific article; zbMATH DE number 1079982