Exploring RANDOMNESS:
In The Unknowable I use LISP to compare my work on incompleteness with that of G6del and Turing, and in The Limits of Mathematics I use LISP to discuss my work on incompleteness in more detail. In this book we'll use LISP to explore my theory of randomness, called algorithmic information theory...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
London
Springer London
2001
|
Ausgabe: | 1st ed. 2001 |
Schriftenreihe: | Discrete Mathematics and Theoretical Computer Science
|
Schlagworte: | |
Online-Zugang: | UBY01 URL des Eerstveröffentlichers |
Zusammenfassung: | In The Unknowable I use LISP to compare my work on incompleteness with that of G6del and Turing, and in The Limits of Mathematics I use LISP to discuss my work on incompleteness in more detail. In this book we'll use LISP to explore my theory of randomness, called algorithmic information theory (AIT). And when I say "explore" I mean it! This book is full of exercises for the reader, ranging from the mathematical equivalent oftrivial "fin ger warm-ups" for pianists, to substantial programming projects, to questions I can formulate precisely but don't know how to answer, to questions that I don't even know how to formulate precisely! I really want you to follow my example and hike offinto the wilder ness and explore AIT on your own! You can stay on the trails that I've blazed and explore the well-known part of AIT, or you can go off on your own and become a fellow researcher, a colleague of mine! One way or another, the goal of this book is to make you into a participant, not a passive observer of AlT. In other words, it's too easy to just listen to a recording of AIT, that's not the way to learn music |
Beschreibung: | 1 Online-Ressource (X, 164 p) |
ISBN: | 9781447103073 |
DOI: | 10.1007/978-1-4471-0307-3 |
Internformat
MARC
LEADER | 00000nmm a2200000zc 4500 | ||
---|---|---|---|
001 | BV047064255 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | cr|uuu---uuuuu | ||
008 | 201216s2001 |||| o||u| ||||||eng d | ||
020 | |a 9781447103073 |9 978-1-4471-0307-3 | ||
024 | 7 | |a 10.1007/978-1-4471-0307-3 |2 doi | |
035 | |a (ZDB-2-SCS)978-1-4471-0307-3 | ||
035 | |a (OCoLC)1227481495 | ||
035 | |a (DE-599)BVBBV047064255 | ||
040 | |a DE-604 |b ger |e aacr | ||
041 | 0 | |a eng | |
049 | |a DE-706 | ||
082 | 0 | |a 005.1 |2 23 | |
084 | |a SK 820 |0 (DE-625)143258: |2 rvk | ||
084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
100 | 1 | |a Chaitin, Gregory J. |e Verfasser |4 aut | |
245 | 1 | 0 | |a Exploring RANDOMNESS |c by Gregory J. Chaitin |
250 | |a 1st ed. 2001 | ||
264 | 1 | |a London |b Springer London |c 2001 | |
300 | |a 1 Online-Ressource (X, 164 p) | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
490 | 0 | |a Discrete Mathematics and Theoretical Computer Science | |
520 | |a In The Unknowable I use LISP to compare my work on incompleteness with that of G6del and Turing, and in The Limits of Mathematics I use LISP to discuss my work on incompleteness in more detail. In this book we'll use LISP to explore my theory of randomness, called algorithmic information theory (AIT). And when I say "explore" I mean it! This book is full of exercises for the reader, ranging from the mathematical equivalent oftrivial "fin ger warm-ups" for pianists, to substantial programming projects, to questions I can formulate precisely but don't know how to answer, to questions that I don't even know how to formulate precisely! I really want you to follow my example and hike offinto the wilder ness and explore AIT on your own! You can stay on the trails that I've blazed and explore the well-known part of AIT, or you can go off on your own and become a fellow researcher, a colleague of mine! One way or another, the goal of this book is to make you into a participant, not a passive observer of AlT. In other words, it's too easy to just listen to a recording of AIT, that's not the way to learn music | ||
650 | 4 | |a Algorithm Analysis and Problem Complexity | |
650 | 4 | |a Algorithms | |
650 | 0 | 7 | |a Informationstheorie |0 (DE-588)4026927-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a LISP |0 (DE-588)4035918-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Stochastischer Prozess |0 (DE-588)4057630-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Zufall |0 (DE-588)4068050-2 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Zufall |0 (DE-588)4068050-2 |D s |
689 | 0 | 1 | |a Informationstheorie |0 (DE-588)4026927-9 |D s |
689 | 0 | 2 | |a LISP |0 (DE-588)4035918-9 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Stochastischer Prozess |0 (DE-588)4057630-9 |D s |
689 | 1 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 1 | |5 DE-604 | |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781852334178 |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781447103080 |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781447110859 |
856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4471-0307-3 |x Verlag |z URL des Eerstveröffentlichers |3 Volltext |
912 | |a ZDB-2-SCS | ||
940 | 1 | |q ZDB-2-SCS_2000/2004 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-032471367 | ||
966 | e | |u https://doi.org/10.1007/978-1-4471-0307-3 |l UBY01 |p ZDB-2-SCS |q ZDB-2-SCS_2000/2004 |x Verlag |3 Volltext |
Datensatz im Suchindex
_version_ | 1804182062042710016 |
---|---|
adam_txt | |
any_adam_object | |
any_adam_object_boolean | |
author | Chaitin, Gregory J. |
author_facet | Chaitin, Gregory J. |
author_role | aut |
author_sort | Chaitin, Gregory J. |
author_variant | g j c gj gjc |
building | Verbundindex |
bvnumber | BV047064255 |
classification_rvk | SK 820 ST 130 |
collection | ZDB-2-SCS |
ctrlnum | (ZDB-2-SCS)978-1-4471-0307-3 (OCoLC)1227481495 (DE-599)BVBBV047064255 |
dewey-full | 005.1 |
dewey-hundreds | 000 - Computer science, information, general works |
dewey-ones | 005 - Computer programming, programs, data, security |
dewey-raw | 005.1 |
dewey-search | 005.1 |
dewey-sort | 15.1 |
dewey-tens | 000 - Computer science, information, general works |
discipline | Informatik Mathematik |
discipline_str_mv | Informatik Mathematik |
doi_str_mv | 10.1007/978-1-4471-0307-3 |
edition | 1st ed. 2001 |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03355nmm a2200601zc 4500</leader><controlfield tag="001">BV047064255</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">201216s2001 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781447103073</subfield><subfield code="9">978-1-4471-0307-3</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4471-0307-3</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SCS)978-1-4471-0307-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1227481495</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047064255</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 820</subfield><subfield code="0">(DE-625)143258:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chaitin, Gregory J.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Exploring RANDOMNESS</subfield><subfield code="c">by Gregory J. Chaitin</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 2001</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">London</subfield><subfield code="b">Springer London</subfield><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (X, 164 p)</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">Discrete Mathematics and Theoretical Computer Science</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">In The Unknowable I use LISP to compare my work on incompleteness with that of G6del and Turing, and in The Limits of Mathematics I use LISP to discuss my work on incompleteness in more detail. In this book we'll use LISP to explore my theory of randomness, called algorithmic information theory (AIT). And when I say "explore" I mean it! This book is full of exercises for the reader, ranging from the mathematical equivalent oftrivial "fin ger warm-ups" for pianists, to substantial programming projects, to questions I can formulate precisely but don't know how to answer, to questions that I don't even know how to formulate precisely! I really want you to follow my example and hike offinto the wilder ness and explore AIT on your own! You can stay on the trails that I've blazed and explore the well-known part of AIT, or you can go off on your own and become a fellow researcher, a colleague of mine! One way or another, the goal of this book is to make you into a participant, not a passive observer of AlT. In other words, it's too easy to just listen to a recording of AIT, that's not the way to learn music</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithm Analysis and Problem Complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Informationstheorie</subfield><subfield code="0">(DE-588)4026927-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">LISP</subfield><subfield code="0">(DE-588)4035918-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Stochastischer Prozess</subfield><subfield code="0">(DE-588)4057630-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Zufall</subfield><subfield code="0">(DE-588)4068050-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Zufall</subfield><subfield code="0">(DE-588)4068050-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Informationstheorie</subfield><subfield code="0">(DE-588)4026927-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">LISP</subfield><subfield code="0">(DE-588)4035918-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Stochastischer Prozess</subfield><subfield code="0">(DE-588)4057630-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</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">9781852334178</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">9781447103080</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">9781447110859</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4471-0307-3</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Eerstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SCS</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SCS_2000/2004</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032471367</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-1-4471-0307-3</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="q">ZDB-2-SCS_2000/2004</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
id | DE-604.BV047064255 |
illustrated | Not Illustrated |
index_date | 2024-07-03T16:12:22Z |
indexdate | 2024-07-10T09:01:34Z |
institution | BVB |
isbn | 9781447103073 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032471367 |
oclc_num | 1227481495 |
open_access_boolean | |
owner | DE-706 |
owner_facet | DE-706 |
physical | 1 Online-Ressource (X, 164 p) |
psigel | ZDB-2-SCS ZDB-2-SCS_2000/2004 ZDB-2-SCS ZDB-2-SCS_2000/2004 |
publishDate | 2001 |
publishDateSearch | 2001 |
publishDateSort | 2001 |
publisher | Springer London |
record_format | marc |
series2 | Discrete Mathematics and Theoretical Computer Science |
spelling | Chaitin, Gregory J. Verfasser aut Exploring RANDOMNESS by Gregory J. Chaitin 1st ed. 2001 London Springer London 2001 1 Online-Ressource (X, 164 p) txt rdacontent c rdamedia cr rdacarrier Discrete Mathematics and Theoretical Computer Science In The Unknowable I use LISP to compare my work on incompleteness with that of G6del and Turing, and in The Limits of Mathematics I use LISP to discuss my work on incompleteness in more detail. In this book we'll use LISP to explore my theory of randomness, called algorithmic information theory (AIT). And when I say "explore" I mean it! This book is full of exercises for the reader, ranging from the mathematical equivalent oftrivial "fin ger warm-ups" for pianists, to substantial programming projects, to questions I can formulate precisely but don't know how to answer, to questions that I don't even know how to formulate precisely! I really want you to follow my example and hike offinto the wilder ness and explore AIT on your own! You can stay on the trails that I've blazed and explore the well-known part of AIT, or you can go off on your own and become a fellow researcher, a colleague of mine! One way or another, the goal of this book is to make you into a participant, not a passive observer of AlT. In other words, it's too easy to just listen to a recording of AIT, that's not the way to learn music Algorithm Analysis and Problem Complexity Algorithms Informationstheorie (DE-588)4026927-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf LISP (DE-588)4035918-9 gnd rswk-swf Stochastischer Prozess (DE-588)4057630-9 gnd rswk-swf Zufall (DE-588)4068050-2 gnd rswk-swf Zufall (DE-588)4068050-2 s Informationstheorie (DE-588)4026927-9 s LISP (DE-588)4035918-9 s DE-604 Stochastischer Prozess (DE-588)4057630-9 s Algorithmus (DE-588)4001183-5 s Erscheint auch als Druck-Ausgabe 9781852334178 Erscheint auch als Druck-Ausgabe 9781447103080 Erscheint auch als Druck-Ausgabe 9781447110859 https://doi.org/10.1007/978-1-4471-0307-3 Verlag URL des Eerstveröffentlichers Volltext |
spellingShingle | Chaitin, Gregory J. Exploring RANDOMNESS Algorithm Analysis and Problem Complexity Algorithms Informationstheorie (DE-588)4026927-9 gnd Algorithmus (DE-588)4001183-5 gnd LISP (DE-588)4035918-9 gnd Stochastischer Prozess (DE-588)4057630-9 gnd Zufall (DE-588)4068050-2 gnd |
subject_GND | (DE-588)4026927-9 (DE-588)4001183-5 (DE-588)4035918-9 (DE-588)4057630-9 (DE-588)4068050-2 |
title | Exploring RANDOMNESS |
title_auth | Exploring RANDOMNESS |
title_exact_search | Exploring RANDOMNESS |
title_exact_search_txtP | Exploring RANDOMNESS |
title_full | Exploring RANDOMNESS by Gregory J. Chaitin |
title_fullStr | Exploring RANDOMNESS by Gregory J. Chaitin |
title_full_unstemmed | Exploring RANDOMNESS by Gregory J. Chaitin |
title_short | Exploring RANDOMNESS |
title_sort | exploring randomness |
topic | Algorithm Analysis and Problem Complexity Algorithms Informationstheorie (DE-588)4026927-9 gnd Algorithmus (DE-588)4001183-5 gnd LISP (DE-588)4035918-9 gnd Stochastischer Prozess (DE-588)4057630-9 gnd Zufall (DE-588)4068050-2 gnd |
topic_facet | Algorithm Analysis and Problem Complexity Algorithms Informationstheorie Algorithmus LISP Stochastischer Prozess Zufall |
url | https://doi.org/10.1007/978-1-4471-0307-3 |
work_keys_str_mv | AT chaitingregoryj exploringrandomness |