Last update: Thu Sep 27 02:46:46 MDT 2018
@Article{Gacs:1983:RBD,
author = "P. Gacs",
title = "On the relation between descriptional complexity and
algorithmic probability",
journal = j-THEOR-COMP-SCI,
volume = "22",
number = "1--2",
pages = "71--93",
month = jan,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1140E (Game theory); C1260 (Information theory);
C4210 (Formal logic); C4240 (Programming and algorithm
theory); C6120 (File organisation)",
corpsource = "Computer Sci. Dept., Univ. of Rochester, Rochester,
NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "a priori probability; algorithm theory; algorithmic
information theory; algorithmic probability;
descriptional complexity; formal logic; game theory;
inductive inference; information theory; logarithm;
probability; storage allocation; two-person
memory-allocation game",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}