Kolmogorov complexity and algorithmic randomness:
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Providence, Rhode Island
American Mathematical Society
[2017]
|
| Series: | Mathematical surveys and monographs
volume 220 |
| Subjects: | |
| Online Access: | DE-19 DE-355 Volltext |
| Physical Description: | 1 Online-Ressource (xviii, 511 Seiten) Diagramme |
| ISBN: | 9781470440831 |
| DOI: | 10.1090/surv/220 |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV046299457 | ||
| 003 | DE-604 | ||
| 005 | 20250130 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 191211s2017 xxu|||| o|||| 00||| eng d | ||
| 020 | |a 9781470440831 |c online |9 978-1-4704-4083-1 | ||
| 024 | 7 | |a 10.1090/surv/220 |2 doi | |
| 035 | |a (OCoLC)1135412031 | ||
| 035 | |a (DE-599)BVBBV046299457 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 044 | |a xxu |c US | ||
| 049 | |a DE-19 |a DE-83 |a DE-11 |a DE-355 | ||
| 050 | 0 | |a QA267.7 | |
| 082 | 0 | |a 511.3/42 |2 23 | |
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a SK 800 |0 (DE-625)143256: |2 rvk | ||
| 100 | 1 | |a Šen, Aleksandr Ch. |d 1958- |e Verfasser |0 (DE-588)130558648 |4 aut | |
| 240 | 1 | 0 | |a Kolmogorovskaya slozhnost i algoritmieskaya sluchanost |
| 245 | 1 | 0 | |a Kolmogorov complexity and algorithmic randomness |c A. Shen, V.A. Uspensky, N. Vereshchagin |
| 264 | 1 | |a Providence, Rhode Island |b American Mathematical Society |c [2017] | |
| 264 | 4 | |c © 2017 | |
| 300 | |a 1 Online-Ressource (xviii, 511 Seiten) |b Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a Mathematical surveys and monographs |v volume 220 | |
| 650 | 4 | |a Computer science ... Theory of computing ... Algorithmic information theory (Kolmogorov complexity, etc.) / msc | |
| 650 | 4 | |a Mathematical logic and foundations ... Computability and recursion theory ... Algorithmic randomness and dimension / msc | |
| 650 | 4 | |a Probability theory and stochastic processes ... Foundations of probability theory ... None of the above, but in this section / msc | |
| 650 | 4 | |a Mathematics education ... Combinatorics, graph theory, probability theory, statistics ... Foundations and methodology of statistics / msc | |
| 650 | 4 | |a Kolmogorov complexity | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Information theory | |
| 650 | 4 | |a Computer science ... Theory of computing ... Algorithmic information theory (Kolmogorov complexity, etc.) | |
| 650 | 4 | |a Mathematical logic and foundations ... Computability and recursion theory ... Algorithmic randomness and dimension | |
| 650 | 4 | |a Probability theory and stochastic processes ... Foundations of probability theory ... None of the above, but in this section | |
| 650 | 4 | |a Mathematics education ... Combinatorics, graph theory, probability theory, statistics ... Foundations and methodology of statistics | |
| 700 | 1 | |a Uspenskij, Vladimir Andreevič |d 1930-2018 |e Verfasser |0 (DE-588)127371729 |4 aut | |
| 700 | 1 | |a Vereščagin, Nikolaj K. |d 1958- |e Verfasser |0 (DE-588)130556548 |4 aut | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-1-4704-3182-2 |
| 830 | 0 | |a Mathematical surveys and monographs |v volume 220 |w (DE-604)BV042339669 |9 220 | |
| 856 | 4 | 0 | |u https://doi.org/10.1090/surv/220 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-138-AMS | ||
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-031676814 | |
| 966 | e | |u https://doi.org/10.1090/surv/220 |l DE-19 |p ZDB-138-AMS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1090/surv/220 |l DE-355 |p ZDB-138-AMS |x Verlag |3 Volltext | |
Record in the Search Index
| _version_ | 1822671421856284672 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Šen, Aleksandr Ch. 1958- Uspenskij, Vladimir Andreevič 1930-2018 Vereščagin, Nikolaj K. 1958- |
| author_GND | (DE-588)130558648 (DE-588)127371729 (DE-588)130556548 |
| author_facet | Šen, Aleksandr Ch. 1958- Uspenskij, Vladimir Andreevič 1930-2018 Vereščagin, Nikolaj K. 1958- |
| author_role | aut aut aut |
| author_sort | Šen, Aleksandr Ch. 1958- |
| author_variant | a c š ac acš v a u va vau n k v nk nkv |
| building | Verbundindex |
| bvnumber | BV046299457 |
| callnumber-first | Q - Science |
| callnumber-label | QA267 |
| callnumber-raw | QA267.7 |
| callnumber-search | QA267.7 |
| callnumber-sort | QA 3267.7 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 134 SK 890 SK 800 |
| collection | ZDB-138-AMS |
| ctrlnum | (OCoLC)1135412031 (DE-599)BVBBV046299457 |
| dewey-full | 511.3/42 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3/42 |
| dewey-search | 511.3/42 |
| dewey-sort | 3511.3 242 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| doi_str_mv | 10.1090/surv/220 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV046299457</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20250130</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">191211s2017 xxu|||| o|||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781470440831</subfield><subfield code="c">online</subfield><subfield code="9">978-1-4704-4083-1</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1090/surv/220</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1135412031</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV046299457</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">xxu</subfield><subfield code="c">US</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-19</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-355</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA267.7</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3/42</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 800</subfield><subfield code="0">(DE-625)143256:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" 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="240" ind1="1" ind2="0"><subfield code="a">Kolmogorovskaya slozhnost i algoritmieskaya sluchanost</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Kolmogorov complexity and algorithmic randomness</subfield><subfield code="c">A. Shen, V.A. Uspensky, N. Vereshchagin</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Providence, Rhode Island</subfield><subfield code="b">American Mathematical Society</subfield><subfield code="c">[2017]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 2017</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xviii, 511 Seiten)</subfield><subfield code="b">Diagramme</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Mathematical surveys and monographs</subfield><subfield code="v">volume 220</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science ... Theory of computing ... Algorithmic information theory (Kolmogorov complexity, etc.) / msc</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical logic and foundations ... Computability and recursion theory ... Algorithmic randomness and dimension / msc</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Probability theory and stochastic processes ... Foundations of probability theory ... None of the above, but in this section / msc</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics education ... Combinatorics, graph theory, probability theory, statistics ... Foundations and methodology of statistics / msc</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Kolmogorov complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Information theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science ... Theory of computing ... Algorithmic information theory (Kolmogorov complexity, etc.)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical logic and foundations ... Computability and recursion theory ... Algorithmic randomness and dimension</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Probability theory and stochastic processes ... Foundations of probability theory ... None of the above, but in this section</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics education ... Combinatorics, graph theory, probability theory, statistics ... Foundations and methodology of statistics</subfield></datafield><datafield tag="700" 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="700" ind1="1" ind2=" "><subfield code="a">Vereščagin, Nikolaj K.</subfield><subfield code="d">1958-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)130556548</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">978-1-4704-3182-2</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Mathematical surveys and monographs</subfield><subfield code="v">volume 220</subfield><subfield code="w">(DE-604)BV042339669</subfield><subfield code="9">220</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1090/surv/220</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-138-AMS</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-031676814</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1090/surv/220</subfield><subfield code="l">DE-19</subfield><subfield code="p">ZDB-138-AMS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1090/surv/220</subfield><subfield code="l">DE-355</subfield><subfield code="p">ZDB-138-AMS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV046299457 |
| illustrated | Not Illustrated |
| indexdate | 2025-01-30T11:02:01Z |
| institution | BVB |
| isbn | 9781470440831 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-031676814 |
| oclc_num | 1135412031 |
| open_access_boolean | |
| owner | DE-19 DE-BY-UBM DE-83 DE-11 DE-355 DE-BY-UBR |
| owner_facet | DE-19 DE-BY-UBM DE-83 DE-11 DE-355 DE-BY-UBR |
| physical | 1 Online-Ressource (xviii, 511 Seiten) Diagramme |
| psigel | ZDB-138-AMS |
| publishDate | 2017 |
| publishDateSearch | 2017 |
| publishDateSort | 2017 |
| publisher | American Mathematical Society |
| record_format | marc |
| series | Mathematical surveys and monographs |
| series2 | Mathematical surveys and monographs |
| spelling | Šen, Aleksandr Ch. 1958- Verfasser (DE-588)130558648 aut Kolmogorovskaya slozhnost i algoritmieskaya sluchanost Kolmogorov complexity and algorithmic randomness A. Shen, V.A. Uspensky, N. Vereshchagin Providence, Rhode Island American Mathematical Society [2017] © 2017 1 Online-Ressource (xviii, 511 Seiten) Diagramme txt rdacontent c rdamedia cr rdacarrier Mathematical surveys and monographs volume 220 Computer science ... Theory of computing ... Algorithmic information theory (Kolmogorov complexity, etc.) / msc Mathematical logic and foundations ... Computability and recursion theory ... Algorithmic randomness and dimension / msc Probability theory and stochastic processes ... Foundations of probability theory ... None of the above, but in this section / msc Mathematics education ... Combinatorics, graph theory, probability theory, statistics ... Foundations and methodology of statistics / msc Kolmogorov complexity Computational complexity Information theory Computer science ... Theory of computing ... Algorithmic information theory (Kolmogorov complexity, etc.) Mathematical logic and foundations ... Computability and recursion theory ... Algorithmic randomness and dimension Probability theory and stochastic processes ... Foundations of probability theory ... None of the above, but in this section Mathematics education ... Combinatorics, graph theory, probability theory, statistics ... Foundations and methodology of statistics Uspenskij, Vladimir Andreevič 1930-2018 Verfasser (DE-588)127371729 aut Vereščagin, Nikolaj K. 1958- Verfasser (DE-588)130556548 aut Erscheint auch als Druck-Ausgabe 978-1-4704-3182-2 Mathematical surveys and monographs volume 220 (DE-604)BV042339669 220 https://doi.org/10.1090/surv/220 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Šen, Aleksandr Ch. 1958- Uspenskij, Vladimir Andreevič 1930-2018 Vereščagin, Nikolaj K. 1958- Kolmogorov complexity and algorithmic randomness Mathematical surveys and monographs Computer science ... Theory of computing ... Algorithmic information theory (Kolmogorov complexity, etc.) / msc Mathematical logic and foundations ... Computability and recursion theory ... Algorithmic randomness and dimension / msc Probability theory and stochastic processes ... Foundations of probability theory ... None of the above, but in this section / msc Mathematics education ... Combinatorics, graph theory, probability theory, statistics ... Foundations and methodology of statistics / msc Kolmogorov complexity Computational complexity Information theory Computer science ... Theory of computing ... Algorithmic information theory (Kolmogorov complexity, etc.) Mathematical logic and foundations ... Computability and recursion theory ... Algorithmic randomness and dimension Probability theory and stochastic processes ... Foundations of probability theory ... None of the above, but in this section Mathematics education ... Combinatorics, graph theory, probability theory, statistics ... Foundations and methodology of statistics |
| title | Kolmogorov complexity and algorithmic randomness |
| title_alt | Kolmogorovskaya slozhnost i algoritmieskaya sluchanost |
| title_auth | Kolmogorov complexity and algorithmic randomness |
| title_exact_search | Kolmogorov complexity and algorithmic randomness |
| title_full | Kolmogorov complexity and algorithmic randomness A. Shen, V.A. Uspensky, N. Vereshchagin |
| title_fullStr | Kolmogorov complexity and algorithmic randomness A. Shen, V.A. Uspensky, N. Vereshchagin |
| title_full_unstemmed | Kolmogorov complexity and algorithmic randomness A. Shen, V.A. Uspensky, N. Vereshchagin |
| title_short | Kolmogorov complexity and algorithmic randomness |
| title_sort | kolmogorov complexity and algorithmic randomness |
| topic | Computer science ... Theory of computing ... Algorithmic information theory (Kolmogorov complexity, etc.) / msc Mathematical logic and foundations ... Computability and recursion theory ... Algorithmic randomness and dimension / msc Probability theory and stochastic processes ... Foundations of probability theory ... None of the above, but in this section / msc Mathematics education ... Combinatorics, graph theory, probability theory, statistics ... Foundations and methodology of statistics / msc Kolmogorov complexity Computational complexity Information theory Computer science ... Theory of computing ... Algorithmic information theory (Kolmogorov complexity, etc.) Mathematical logic and foundations ... Computability and recursion theory ... Algorithmic randomness and dimension Probability theory and stochastic processes ... Foundations of probability theory ... None of the above, but in this section Mathematics education ... Combinatorics, graph theory, probability theory, statistics ... Foundations and methodology of statistics |
| topic_facet | Computer science ... Theory of computing ... Algorithmic information theory (Kolmogorov complexity, etc.) / msc Mathematical logic and foundations ... Computability and recursion theory ... Algorithmic randomness and dimension / msc Probability theory and stochastic processes ... Foundations of probability theory ... None of the above, but in this section / msc Mathematics education ... Combinatorics, graph theory, probability theory, statistics ... Foundations and methodology of statistics / msc Kolmogorov complexity Computational complexity Information theory Computer science ... Theory of computing ... Algorithmic information theory (Kolmogorov complexity, etc.) Mathematical logic and foundations ... Computability and recursion theory ... Algorithmic randomness and dimension Probability theory and stochastic processes ... Foundations of probability theory ... None of the above, but in this section Mathematics education ... Combinatorics, graph theory, probability theory, statistics ... Foundations and methodology of statistics |
| url | https://doi.org/10.1090/surv/220 |
| volume_link | (DE-604)BV042339669 |
| work_keys_str_mv | AT senaleksandrch kolmogorovskayaslozhnostialgoritmieskayasluchanost AT uspenskijvladimirandreevic kolmogorovskayaslozhnostialgoritmieskayasluchanost AT verescaginnikolajk kolmogorovskayaslozhnostialgoritmieskayasluchanost AT senaleksandrch kolmogorovcomplexityandalgorithmicrandomness AT uspenskijvladimirandreevic kolmogorovcomplexityandalgorithmicrandomness AT verescaginnikolajk kolmogorovcomplexityandalgorithmicrandomness |