Skip navigation
Skip navigation

Algorithmic probability

Vitanyi, Paul; Legg, Shane; Hutter, Marcus

Description

Algorithmic "Solomonoff" Probability (AP) assigns to objects an a priori probability that is in some sense universal. This prior distribution has theoretical applications in a number of areas, including inductive inference theory and the time complexity analysis of algorithms. Its main drawback is that it is not computable and thus can only be approximated in practice.

CollectionsANU Research Publications
Date published: 2007
Type: Journal article
URI: http://hdl.handle.net/1885/15013
Source: Scholarpedia
DOI: 10.4249/scholarpedia.2572

Download

File Description SizeFormat Image
Hutter et al Algorithmic Probability 2007.pdf437.21 kBAdobe PDFThumbnail


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  12 November 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator