Algorithmic randomness: progress and prospects
The last two decades have seen a wave of exciting new developments in the theory of algorithmic randomness and its applications to other areas of mathematics. This volume surveys much of the recent work that has not been included in published volumes until now. It contains a range of articles on alg...
Gespeichert in:
| Weitere Verfasser: | , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2020
|
| Schriftenreihe: | Lecture notes in logic
50 |
| Schlagworte: | |
| Online-Zugang: | BSB01 FHN01 UBA01 Volltext |
| Zusammenfassung: | The last two decades have seen a wave of exciting new developments in the theory of algorithmic randomness and its applications to other areas of mathematics. This volume surveys much of the recent work that has not been included in published volumes until now. It contains a range of articles on algorithmic randomness and its interactions with closely related topics such as computability theory and computational complexity, as well as wider applications in areas of mathematics including analysis, probability, and ergodic theory. In addition to being an indispensable reference for researchers in algorithmic randomness, the unified view of the theory presented here makes this an excellent entry point for graduate students and other newcomers to the field |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 08 May 2020) |
| Beschreibung: | 1 Online-Ressource (x, 359 Seiten) |
| ISBN: | 9781108781718 |
| DOI: | 10.1017/9781108781718 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV046767615 | ||
| 003 | DE-604 | ||
| 005 | 20210615 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 200617s2020 |||| o||u| ||||||eng d | ||
| 020 | |a 9781108781718 |9 978-1-108-78171-8 | ||
| 024 | 7 | |a 10.1017/9781108781718 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9781108781718 | ||
| 035 | |a (OCoLC)1164618822 | ||
| 035 | |a (DE-599)BVBBV046767615 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 |a DE-384 | ||
| 082 | 0 | |a 511.3 | |
| 245 | 1 | 0 | |a Algorithmic randomness |b progress and prospects |c edited by Johanna N.Y. Franklin, Christopher P. Porter |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2020 | |
| 300 | |a 1 Online-Ressource (x, 359 Seiten) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Lecture notes in logic |v 50 | |
| 500 | |a Title from publisher's bibliographic system (viewed on 08 May 2020) | ||
| 520 | |a The last two decades have seen a wave of exciting new developments in the theory of algorithmic randomness and its applications to other areas of mathematics. This volume surveys much of the recent work that has not been included in published volumes until now. It contains a range of articles on algorithmic randomness and its interactions with closely related topics such as computability theory and computational complexity, as well as wider applications in areas of mathematics including analysis, probability, and ergodic theory. In addition to being an indispensable reference for researchers in algorithmic randomness, the unified view of the theory presented here makes this an excellent entry point for graduate students and other newcomers to the field | ||
| 650 | 4 | |a Computational complexity | |
| 700 | 1 | |a Franklin, Johanna N. Y. |d 1979- |0 (DE-588)1212119622 |4 edt | |
| 700 | 1 | |a Porter, Christopher P. |d ca. 20./21. Jh. |0 (DE-588)1212119762 |4 edt | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-1-108-47898-4 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/9781108781718 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-032177082 | ||
| 966 | e | |u https://doi.org/10.1017/9781108781718 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/9781108781718 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/9781108781718 |l UBA01 |p ZDB-20-CBO |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804181538858860544 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author2 | Franklin, Johanna N. Y. 1979- Porter, Christopher P. ca. 20./21. Jh |
| author2_role | edt edt |
| author2_variant | j n y f jny jnyf c p p cp cpp |
| author_GND | (DE-588)1212119622 (DE-588)1212119762 |
| author_facet | Franklin, Johanna N. Y. 1979- Porter, Christopher P. ca. 20./21. Jh |
| building | Verbundindex |
| bvnumber | BV046767615 |
| collection | ZDB-20-CBO |
| ctrlnum | (ZDB-20-CBO)CR9781108781718 (OCoLC)1164618822 (DE-599)BVBBV046767615 |
| dewey-full | 511.3 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3 |
| dewey-search | 511.3 |
| dewey-sort | 3511.3 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| discipline_str_mv | Mathematik |
| doi_str_mv | 10.1017/9781108781718 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02471nmm a2200421zcb4500</leader><controlfield tag="001">BV046767615</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210615 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">200617s2020 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781108781718</subfield><subfield code="9">978-1-108-78171-8</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/9781108781718</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9781108781718</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1164618822</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV046767615</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="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-384</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithmic randomness</subfield><subfield code="b">progress and prospects</subfield><subfield code="c">edited by Johanna N.Y. Franklin, Christopher P. Porter</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2020</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (x, 359 Seiten)</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="0" ind2=" "><subfield code="a">Lecture notes in logic</subfield><subfield code="v">50</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 08 May 2020)</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The last two decades have seen a wave of exciting new developments in the theory of algorithmic randomness and its applications to other areas of mathematics. This volume surveys much of the recent work that has not been included in published volumes until now. It contains a range of articles on algorithmic randomness and its interactions with closely related topics such as computability theory and computational complexity, as well as wider applications in areas of mathematics including analysis, probability, and ergodic theory. In addition to being an indispensable reference for researchers in algorithmic randomness, the unified view of the theory presented here makes this an excellent entry point for graduate students and other newcomers to the field</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Franklin, Johanna N. Y.</subfield><subfield code="d">1979-</subfield><subfield code="0">(DE-588)1212119622</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Porter, Christopher P.</subfield><subfield code="d">ca. 20./21. Jh.</subfield><subfield code="0">(DE-588)1212119762</subfield><subfield code="4">edt</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-108-47898-4</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/9781108781718</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-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032177082</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781108781718</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</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.1017/9781108781718</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</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.1017/9781108781718</subfield><subfield code="l">UBA01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV046767615 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T14:45:49Z |
| indexdate | 2024-07-10T08:53:15Z |
| institution | BVB |
| isbn | 9781108781718 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032177082 |
| oclc_num | 1164618822 |
| open_access_boolean | |
| owner | DE-12 DE-92 DE-384 |
| owner_facet | DE-12 DE-92 DE-384 |
| physical | 1 Online-Ressource (x, 359 Seiten) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
| publishDate | 2020 |
| publishDateSearch | 2020 |
| publishDateSort | 2020 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | Lecture notes in logic |
| spelling | Algorithmic randomness progress and prospects edited by Johanna N.Y. Franklin, Christopher P. Porter Cambridge Cambridge University Press 2020 1 Online-Ressource (x, 359 Seiten) txt rdacontent c rdamedia cr rdacarrier Lecture notes in logic 50 Title from publisher's bibliographic system (viewed on 08 May 2020) The last two decades have seen a wave of exciting new developments in the theory of algorithmic randomness and its applications to other areas of mathematics. This volume surveys much of the recent work that has not been included in published volumes until now. It contains a range of articles on algorithmic randomness and its interactions with closely related topics such as computability theory and computational complexity, as well as wider applications in areas of mathematics including analysis, probability, and ergodic theory. In addition to being an indispensable reference for researchers in algorithmic randomness, the unified view of the theory presented here makes this an excellent entry point for graduate students and other newcomers to the field Computational complexity Franklin, Johanna N. Y. 1979- (DE-588)1212119622 edt Porter, Christopher P. ca. 20./21. Jh. (DE-588)1212119762 edt Erscheint auch als Druck-Ausgabe 978-1-108-47898-4 https://doi.org/10.1017/9781108781718 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Algorithmic randomness progress and prospects Computational complexity |
| title | Algorithmic randomness progress and prospects |
| title_auth | Algorithmic randomness progress and prospects |
| title_exact_search | Algorithmic randomness progress and prospects |
| title_exact_search_txtP | Algorithmic randomness progress and prospects |
| title_full | Algorithmic randomness progress and prospects edited by Johanna N.Y. Franklin, Christopher P. Porter |
| title_fullStr | Algorithmic randomness progress and prospects edited by Johanna N.Y. Franklin, Christopher P. Porter |
| title_full_unstemmed | Algorithmic randomness progress and prospects edited by Johanna N.Y. Franklin, Christopher P. Porter |
| title_short | Algorithmic randomness |
| title_sort | algorithmic randomness progress and prospects |
| title_sub | progress and prospects |
| topic | Computational complexity |
| topic_facet | Computational complexity |
| url | https://doi.org/10.1017/9781108781718 |
| work_keys_str_mv | AT franklinjohannany algorithmicrandomnessprogressandprospects AT porterchristopherp algorithmicrandomnessprogressandprospects |