Algorithmic information

Article Version española  Editor Burgin, Mark markburg@cs.ucla.edu  Incorporated contributions Burgin (17/02/2011)  Usage domain Computer science, coding science, Algorithmic information Theory, Complexity theory  Type concept  French information algorithmique  German algorithmische Information   Algorithmic information reflects aspects and properties of information related to algorithms (s. also Algorithmic information Theory). Many information processes, such as network messaging or computer information processing, have algorithmic nature as they are performed according to various algorithms. Two kinds of algorithmic information are considered: (1) algorithmic information necessary to build a constructive object by a given system of algorithms and (2) algorithmic information in an object, e.g., message, which allows making simpler construction of another object. The most popular measure of algorithmic information of the first type is absolute Kolmogorov or algorithmic complexity. The most popular measure of algorithmic information of the second type is relative Kolmogorov or algorithmic complexity (®Kolmogorov complexity). According to the classes of algorithms used for information acquisition, processing and utilization, three types of algorithmic information have been separated and studied:  subrecursive algorithmic information, recursive algorithmic information (®Kolmogorov complexity), and super-recursive algorithmic information (®Super-recursive Kolmogorov complexity).   References BURGIN, M. (2010). Theory of Information: Fundamentality, Diversity and Unification. Singapore: World Scientific Publishing. CHAITIN, G. J. (1966). "On the length of programs for computing finite binary sequences". Journal of the Association for Computing Machinery, Vol. 13, 547-569. KOLMOGOROFF, A. N. (1965). Three approaches to the quantitative definition of ‘information'. Problems of Information Transmission, Vol. 1, Num. 1, 3-11. SOLOMONOFF, R. J. (1960). A Preliminary Report on a General Theory of Inductive Inference. Report V-131, Zator Co., Cambridge, Ma. Feb 4, 1960. SOLOMONOFF, R. J. (1964). A formal theory of inductive inference. Inf. Control, Vol. 7, 1-22 (I part), 224-254 (II part).

Entries New entry. For doing a new entry: (1) the user must be identified as an authorized user(to this end, the "sign in" link at the page bottom left can be followed). (2) After being identified, press the "edit page" button at he upper right corner. (3) Being in edition mode, substitute -under this blue paragraph- "name" by the authors' names, "date" by the date in which the text is entered; and the following line by the proposed text. At the bottom of the entry, the references -used in the proposed text- must be given using the normalized format. (4) To finish, press the "save" button at the upper right corner. The entry will be reviewed by the editor and -at least- another peer, and subsequently articulated in the article if elected. Name (dd/mm/yyyy) [To be substituted by the author with the proposed text] Incorporated entries Whenever an entry is integrated in the article (left column) the corresponding entry is reflected in this section. Mark Burgin (17/02/2011) [Incorporated after being reviewed into the article column, 16/12/2011]