Relations between varieties of Kolmogorov complexities:
Abstract: "There are several sorts of Kolmogorov complexity, better to say several Kolmogorov complexities: decision complexity, simple complexity, prefix complexity, monotonic complexity, a priori complexity. The last three can and the first two cannot be used for defining randomness of an inf...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Amsterdam
1993
|
| Series: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
93,29 |
| Subjects: | |
| Summary: | Abstract: "There are several sorts of Kolmogorov complexity, better to say several Kolmogorov complexities: decision complexity, simple complexity, prefix complexity, monotonic complexity, a priori complexity. The last three can and the first two cannot be used for defining randomness of an infinite binary sequence. All those five versions of Kolmogorov complexity were considered, from a unified point of view, in a paper by the first author which appeared in O. Watanabe's book [5], and which is included as a supplement of this report, with the kind permission of Springer-Verlag. Upper and lower bounds for those complexities and also for their differences were announced in that paper without proofs. The purpose of this paper is to give proofs for those bounds In this paper, the word 'entropy' (not in a physical sense) is used instead of 'complexity'. This is a Moscow tradition suggested by A.N. Kolmogorov himself. By this tradition the term 'complexity' relates to any mode of description and 'entropy' is the complexity related to an optimal mode (i.e. to a mode that, roughly speaking, gives the shortest descriptions). |
| Physical Description: | 38 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009034602 | ||
| 003 | DE-604 | ||
| 005 | 20030307 | ||
| 007 | t | ||
| 008 | 940227s1993 |||| 00||| eng d | ||
| 035 | |a (OCoLC)31129823 | ||
| 035 | |a (DE-599)BVBBV009034602 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Uspenskij, Vladimir Andreevič |d 1930-2018 |e Verfasser |0 (DE-588)127371729 |4 aut | |
| 245 | 1 | 0 | |a Relations between varieties of Kolmogorov complexities |c V. A. Uspensky, A. Shen |
| 264 | 1 | |a Amsterdam |c 1993 | |
| 300 | |a 38 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |v 93,29 | |
| 520 | 3 | |a Abstract: "There are several sorts of Kolmogorov complexity, better to say several Kolmogorov complexities: decision complexity, simple complexity, prefix complexity, monotonic complexity, a priori complexity. The last three can and the first two cannot be used for defining randomness of an infinite binary sequence. All those five versions of Kolmogorov complexity were considered, from a unified point of view, in a paper by the first author which appeared in O. Watanabe's book [5], and which is included as a supplement of this report, with the kind permission of Springer-Verlag. Upper and lower bounds for those complexities and also for their differences were announced in that paper without proofs. The purpose of this paper is to give proofs for those bounds | |
| 520 | 3 | |a In this paper, the word 'entropy' (not in a physical sense) is used instead of 'complexity'. This is a Moscow tradition suggested by A.N. Kolmogorov himself. By this tradition the term 'complexity' relates to any mode of description and 'entropy' is the complexity related to an optimal mode (i.e. to a mode that, roughly speaking, gives the shortest descriptions). | |
| 650 | 4 | |a Kolmogorov complexity | |
| 700 | 1 | |a Šen, Aleksandr Ch. |d 1958- |e Verfasser |0 (DE-588)130558648 |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 93,29 |w (DE-604)BV008928356 |9 93,29 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005977154 | ||
Record in the Search Index
| _version_ | 1804123388004794368 |
|---|---|
| any_adam_object | |
| author | Uspenskij, Vladimir Andreevič 1930-2018 Šen, Aleksandr Ch. 1958- |
| author_GND | (DE-588)127371729 (DE-588)130558648 |
| author_facet | Uspenskij, Vladimir Andreevič 1930-2018 Šen, Aleksandr Ch. 1958- |
| author_role | aut aut |
| author_sort | Uspenskij, Vladimir Andreevič 1930-2018 |
| author_variant | v a u va vau a c š ac acš |
| building | Verbundindex |
| bvnumber | BV009034602 |
| ctrlnum | (OCoLC)31129823 (DE-599)BVBBV009034602 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02243nam a2200313 cb4500</leader><controlfield tag="001">BV009034602</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20030307 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940227s1993 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31129823</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009034602</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Uspenskij, Vladimir Andreevič</subfield><subfield code="d">1930-2018</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)127371729</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Relations between varieties of Kolmogorov complexities</subfield><subfield code="c">V. A. Uspensky, A. Shen</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">38 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">93,29</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "There are several sorts of Kolmogorov complexity, better to say several Kolmogorov complexities: decision complexity, simple complexity, prefix complexity, monotonic complexity, a priori complexity. The last three can and the first two cannot be used for defining randomness of an infinite binary sequence. All those five versions of Kolmogorov complexity were considered, from a unified point of view, in a paper by the first author which appeared in O. Watanabe's book [5], and which is included as a supplement of this report, with the kind permission of Springer-Verlag. Upper and lower bounds for those complexities and also for their differences were announced in that paper without proofs. The purpose of this paper is to give proofs for those bounds</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">In this paper, the word 'entropy' (not in a physical sense) is used instead of 'complexity'. This is a Moscow tradition suggested by A.N. Kolmogorov himself. By this tradition the term 'complexity' relates to any mode of description and 'entropy' is the complexity related to an optimal mode (i.e. to a mode that, roughly speaking, gives the shortest descriptions).</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Kolmogorov complexity</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Šen, Aleksandr Ch.</subfield><subfield code="d">1958-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)130558648</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">93,29</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">93,29</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005977154</subfield></datafield></record></collection> |
| id | DE-604.BV009034602 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:58Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005977154 |
| oclc_num | 31129823 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 38 S. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Uspenskij, Vladimir Andreevič 1930-2018 Verfasser (DE-588)127371729 aut Relations between varieties of Kolmogorov complexities V. A. Uspensky, A. Shen Amsterdam 1993 38 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 93,29 Abstract: "There are several sorts of Kolmogorov complexity, better to say several Kolmogorov complexities: decision complexity, simple complexity, prefix complexity, monotonic complexity, a priori complexity. The last three can and the first two cannot be used for defining randomness of an infinite binary sequence. All those five versions of Kolmogorov complexity were considered, from a unified point of view, in a paper by the first author which appeared in O. Watanabe's book [5], and which is included as a supplement of this report, with the kind permission of Springer-Verlag. Upper and lower bounds for those complexities and also for their differences were announced in that paper without proofs. The purpose of this paper is to give proofs for those bounds In this paper, the word 'entropy' (not in a physical sense) is used instead of 'complexity'. This is a Moscow tradition suggested by A.N. Kolmogorov himself. By this tradition the term 'complexity' relates to any mode of description and 'entropy' is the complexity related to an optimal mode (i.e. to a mode that, roughly speaking, gives the shortest descriptions). Kolmogorov complexity Šen, Aleksandr Ch. 1958- Verfasser (DE-588)130558648 aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 93,29 (DE-604)BV008928356 93,29 |
| spellingShingle | Uspenskij, Vladimir Andreevič 1930-2018 Šen, Aleksandr Ch. 1958- Relations between varieties of Kolmogorov complexities Kolmogorov complexity |
| title | Relations between varieties of Kolmogorov complexities |
| title_auth | Relations between varieties of Kolmogorov complexities |
| title_exact_search | Relations between varieties of Kolmogorov complexities |
| title_full | Relations between varieties of Kolmogorov complexities V. A. Uspensky, A. Shen |
| title_fullStr | Relations between varieties of Kolmogorov complexities V. A. Uspensky, A. Shen |
| title_full_unstemmed | Relations between varieties of Kolmogorov complexities V. A. Uspensky, A. Shen |
| title_short | Relations between varieties of Kolmogorov complexities |
| title_sort | relations between varieties of kolmogorov complexities |
| topic | Kolmogorov complexity |
| topic_facet | Kolmogorov complexity |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT uspenskijvladimirandreevic relationsbetweenvarietiesofkolmogorovcomplexities AT senaleksandrch relationsbetweenvarietiesofkolmogorovcomplexities |