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: | E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2020
|
| Schriftenreihe: | Lecture notes in logic
50 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
MARC
| LEADER | 00000nam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | ZDB-20-CTM-CR9781108781718 | ||
| 003 | UkCbUP | ||
| 005 | 20200608151425.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr|||||||||||| | ||
| 008 | 190603s2020||||enk o ||1 0|eng|d | ||
| 020 | |a 9781108781718 | ||
| 245 | 0 | 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 | ||
| 337 | |b c | ||
| 338 | |b cr | ||
| 490 | 1 | |a Lecture notes in logic |v 50 | |
| 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. | ||
| 700 | 1 | |a Franklin, Johanna N. Y. | |
| 700 | 1 | |a Porter, Christopher | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781108478984 |
| 856 | 4 | 0 | |l TUM01 |p ZDB-20-CTM |q TUM_PDA_CTM |u https://doi.org/10.1017/9781108781718 |3 Volltext |
| 912 | |a ZDB-20-CTM | ||
| 912 | |a ZDB-20-CTM | ||
| 049 | |a DE-91 | ||
Datensatz im Suchindex
| DE-BY-TUM_katkey | ZDB-20-CTM-CR9781108781718 |
|---|---|
| _version_ | 1818779680263634944 |
| adam_text | |
| any_adam_object | |
| author2 | Franklin, Johanna N. Y. Porter, Christopher |
| author2_role | |
| author2_variant | j n y f jny jnyf c p cp |
| author_facet | Franklin, Johanna N. Y. Porter, Christopher |
| author_sort | Franklin, Johanna N. Y. |
| building | Verbundindex |
| bvnumber | localTUM |
| collection | ZDB-20-CTM |
| doi_str_mv | 10.1017/9781108781718 |
| format | eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01576nam a2200265 i 4500</leader><controlfield tag="001">ZDB-20-CTM-CR9781108781718</controlfield><controlfield tag="003">UkCbUP</controlfield><controlfield tag="005">20200608151425.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr||||||||||||</controlfield><controlfield tag="008">190603s2020||||enk o ||1 0|eng|d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781108781718</subfield></datafield><datafield tag="245" ind1="0" 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></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Lecture notes in logic</subfield><subfield code="v">50</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="700" ind1="1" ind2=" "><subfield code="a">Franklin, Johanna N. Y.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Porter, Christopher</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">9781108478984</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">TUM01</subfield><subfield code="p">ZDB-20-CTM</subfield><subfield code="q">TUM_PDA_CTM</subfield><subfield code="u">https://doi.org/10.1017/9781108781718</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
| id | ZDB-20-CTM-CR9781108781718 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-18T12:04:28Z |
| institution | BVB |
| isbn | 9781108781718 |
| language | English |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (x, 359 Seiten) |
| psigel | ZDB-20-CTM |
| 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 c cr Lecture notes in logic 50 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. Franklin, Johanna N. Y. Porter, Christopher Erscheint auch als Druck-Ausgabe 9781108478984 TUM01 ZDB-20-CTM TUM_PDA_CTM https://doi.org/10.1017/9781108781718 Volltext |
| spellingShingle | Algorithmic randomness progress and prospects |
| title | Algorithmic randomness progress and prospects |
| title_auth | Algorithmic randomness progress and prospects |
| title_exact_search | 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 |
| url | https://doi.org/10.1017/9781108781718 |
| work_keys_str_mv | AT franklinjohannany algorithmicrandomnessprogressandprospects AT porterchristopher algorithmicrandomnessprogressandprospects |