The discovery of algorithmic probability: A guide for the programming of true creativity

No abstract is available for this paper.

• Publication year

  1995

• Venue

  European Conference on Computational Learning Theory

• Publication date

  1995-03-13

• Fields of study

  Philosophy, Computer Science

• Identifiers
  DOI 10.1007/3-540-59119-2_165
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Steps toward Artificial Intelligence

  1995cited by this paper
• Language in action

  1991cited by this paper
• An introduction to Kolmogorov - complexity and its applications ; part 1: theory

  1991cited by this paper
• Co-evolving parasites improve simulated evolution as an optimization procedure

  1990cited by this paper
• Genetic programming: a paradigm for genetically breeding populations of computer programs to solve problems

  1990cited by this paper
• A SYSTEM FOR INCREMENTAL LEARNING BASED ON ALGORITHMIC PROBABILITY

  1989cited by this paper
• A SYSTEM FOR INCREMENTAL LEARNING BASED ON ALGORITHMIC PROBABILITY

  1989cited by this paper
• Mathematical Problems in the Biological Sciences

  1987cited by this paper
• The Application of Algorithmic Probability to Problems in Artificial Intelligence

  1985cited by this paper
• Modeling By Shortest Data Description*

  1978cited by this paper
• Complexity-based induction systems: Comparisons and convergence theorems

  1978cited by this paper
• Inductive inference theory: a unified approach to problems in pattern recognition and artificial intelligence

  1975cited by this paper
• A Theory of Program Size Formally Identical to Information Theory

  1975cited by this paper
• Inductive Inference Theory - A Unified Approach to Problems in Pattern Recognition and Artificial Intelligence

  1975cited by this paper
• Process complexity and effective random tests

  1973cited by this paper
• A Procedure for Grammatical Inference

  1971cited by this paper
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS

  1970cited by this paper
• Computational Complexity and Probability Constructions

  1970cited by this paper
• On the Length of Programs for Computing Finite Binary Sequences: statistical considerations

  1969cited by this paper
• Logical basis for information theory and probability theory

  1968cited by this paper
• An Information Measure for Classification

  1968cited by this paper
• Three approaches to the quantitative definition of information

  1968cited by this paper
• On the Length of Programs for Computing Finite Binary Sequences

  1966cited by this paper
• The Definition of Random Sequences

  1966cited by this paper
• A Formal Theory of Inductive Inference. Part II

  1964cited by this paper
• Computers and Thought

  1963cited by this paper
• PROBLEMS OF FORMULATION FOR ARTIFICIAL INTELLIGENCE

  1962cited by this paper
• Three models for the description of language

  1956cited by this paper
• A method for the construction of minimum-redundancy codes

  1952cited by this paper
• Science and Sanity.

  1934cited by this paper

• von Mises circular and Gaussian distributions

  2021cites this paper
• A Framework for Searching for General Artificial Intelligence

  2016cites this paper
• MML, hybrid Bayesian network graphical models, statistical consistency, invarianc

  2010cites this paper
• Foreword re C. S. Wallace

  2008cites this paper
• Multiset Rule-Based Programming Paradigm for Soft-Computing in Complex Systems

  2006cites this paper
• From algorithms to generative grammar and back again

  2004influential citation
• Probabilistic Models of Grammar: Phonology as Information Minimization

  2002cites this paper
• Eden: An Evolutionary Sonic Ecosystem

  2001cites this paper
• Unsupervised Learning of the Morphology of a Natural Language

  2001cites this paper
• PR ] 1 0 O ct 2 00 1 Randomness

  2001cites this paper
• MML clustering of multi-state, Poisson, von Mises circular and Gaussian distributions

  2000cites this paper
• New Error Bounds for Solomonoff Prediction

  1999cites this paper
• MML Mixture Modelling of Multi-state, Poisson, vonMises circular and Gaussian Distributions

  1997cites this paper
• Circular clustering of protein dihedral angles by Minimum Message Length.

  1996cites this paper
• A game of prediction with expert advice

  1995influential citation