Hierarchies of generalized Kolmogorov complexities and nonenumerable universal measures computable in the limit Export

@misc{citeulike:853201, abstract = {The traditional theory of Kolmogorov complexity and algorithmic probability focuses on monotone Turing machines with one-way write-only output tape. This naturally leads to the universal enumerable Solomono-Levin measure. Here we introduce more general, nonenumerable but cumulatively enumerable measures (CEMs) derived from Turing machines with lexicographically nondecreasing output and random input, and even more general approximable measures and distributions computable in the limit. We ...}, author = {Schmidhuber, J.}, citeulike-article-id = {853201}, citeulike-linkout-0 = {http://citeseer.ist.psu.edu/schmidhuber00hierarchies.html}, citeulike-linkout-1 = {http://citeseer.lcs.mit.edu/schmidhuber00hierarchies.html}, citeulike-linkout-2 = {http://citeseer.ifi.unizh.ch/schmidhuber00hierarchies.html}, citeulike-linkout-3 = {http://citeseer.comp.nus.edu.sg/schmidhuber00hierarchies.html}, keywords = {algorithmic-information-content, algorithmic-information-theory, computational-epistemology, generalized-algorithmic-probability, generalized-fractal-dimension, generalized-kolmogorov-complexity, incompleteness, kolmogorov-complexity, order-theory, paraconsistency, partial-order, qait, total-order}, posted-at = {2006-09-21 16:31:47}, priority = {2}, title = {Hierarchies of generalized Kolmogorov complexities and nonenumerable universal measures computable in the limit}, url = {http://citeseer.ist.psu.edu/schmidhuber00hierarchies.html}, year = {2002} }

TY - GEN ID - citeulike:853201 L3 - citeulike-article-id:853201 N2 - The traditional theory of Kolmogorov complexity and algorithmic probability focuses on monotone Turing machines with one-way write-only output tape. This naturally leads to the universal enumerable Solomono-Levin measure. Here we introduce more general, nonenumerable but cumulatively enumerable measures (CEMs) derived from Turing machines with lexicographically nondecreasing output and random input, and even more general approximable measures and distributions computable in the limit. We ... TI - Hierarchies of generalized Kolmogorov complexities and nonenumerable universal measures computable in the limit KW - algorithmic-information-content KW - algorithmic-information-theory KW - computational-epistemology KW - generalized-algorithmic-probability KW - generalized-fractal-dimension KW - generalized-kolmogorov-complexity KW - incompleteness KW - kolmogorov-complexity KW - order-theory KW - paraconsistency KW - partial-order KW - qait KW - total-order AU - Schmidhuber, J PY - 2002/// UR - http://citeseer.ist.psu.edu/schmidhuber00hierarchies.html ER -