Picture 1 of 2
Discrete Mathematics and Theoretical Computer Science Ser.: Exploring RANDOMNESS
Condition:
“From private estate. In very good condition.”
Sale ends in: 5d 14h
Postage:
Located in: Spring Hill, Florida, United States
Delivery:
Estimated between Fri, 7 Jun and Mon, 10 Jun to 43230
Returns:
Coverage:
Read item description or contact seller for details. See all detailsSee all details on coverage
(Not eligible for eBay purchase protection programmes)
Seller information
- 100% positive feedback
Registered as a Business Seller
Seller assumes all responsibility for this listing.
eBay item number:226141551199
Item specifics
- Condition
- Very Good
- Seller Notes
- “From private estate. In very good condition.”
- ISBN
- 9781852334178
- Publication Name
- Exploring Randomness
- Item Length
- 9.3in
- Publisher
- Springer London, The Limited
- Publication Year
- 2000
- Series
- Discrete Mathematics and Theoretical Computer Science Ser.
- Type
- Textbook
- Format
- Hardcover
- Language
- English
- Item Height
- 0.3in
- Item Width
- 6.1in
- Item Weight
- 33.5 Oz
- Number of Pages
- X, 164 Pages
About this product
Product Information
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.
Product Identifiers
Publisher
Springer London, The Limited
ISBN-10
1852334177
ISBN-13
9781852334178
eBay Product ID (ePID)
1871060
Product Key Features
Publication Name
Exploring Randomness
Format
Hardcover
Language
English
Publication Year
2000
Series
Discrete Mathematics and Theoretical Computer Science Ser.
Type
Textbook
Number of Pages
X, 164 Pages
Dimensions
Item Length
9.3in
Item Height
0.3in
Item Width
6.1in
Item Weight
33.5 Oz
Additional Product Features
Number of Volumes
1 Vol.
Lc Classification Number
Qa76.9.A43
Reviews
From the reviews: "In this book on algorithmic information theory, the author compares his concept of randomness (for recursive functions) which is based on the complexity (length) of the generating algorithm (program) with other concepts (by Martin-Löw, Solovay) and discusses its relation to incompleteness and the halting problem. Algorithms (needed for proof) are described in a (small) dialect of LISP. The style mostly is that of a lecture, lively and readable." (P. Schmitt, Monatshefte für Mathematik, Vol. 141 (1), 2004) "Chaitin is the main architect of a new branch of mathematics called algorithmic information theory, or 'AIT'. … in Exploring Randomness, he develops algorithmic theory, further revealing its technical core. This is important work, with implications that go far beyond the arcane arguments of one branch of mathematics. … As one gets to the substance … it is difficult to resist Chaitin's enthusiastic style and obvious intelligence. Beyond the technicalities of the argument, the reader is quickly drawn into a fundamental new landscape of ideas." (Jacques F. Vallee, Journal of Scientific Exploration, Vol. 16 (4), 2002) "Chaitin's latest three books form a nice triangular base to support and explore the concepts underlying algorithmic information theory (AIT) a clever blend of Gödel, Turing, and Shannon that Chaitin developed in his late teens … . this set of three volumes packages the material in a nice, quite digestible fashion … . Chaitin's results demonstrate that not only there is no structure to foundation of mathematics, the foundation is in fact random." (The Mathematica Journal, April, 2002) "The book is devoted to a Lisp formalism for exploring the basic ideas, concepts and results on program-size complexity and random sequences. The book contains a wealth of exercises, ranging from the 'mathematical equivalent of finger warm-ups for pianists' to substantial programming projects, from open questions to questions the author cannot even formulate. Highly recommended to anyone interested in understanding algorithmic information theory through programming." (Cristian S. Calude, Zentralblatt MATH, Vol. 963, 2002) "This book uses LISP to explore the theory of randomness, called algorithmic information theory (AIT). This is the third of Chaitin's book … . The common theme of the books is the study of H(x), the size in bits of the smallest program for calculating x … . Each book has a different emphasis. This book gives a detailed discussion of the metamathematical implications of these ideas and presents the technical core of Chaitin's algorithmic theory." (Book News on the Internet, October, 2001) "This is revolutionary, explosive stuff. … Chaitin challenges readers to follow his lead and forge their own path into the black hole of randomness, the 'darkness at the edge of mathematics'. When Chaitin wrote 'explore', he well and truly meant it. An exhilarating, mind-blowing book from one of the great ideas men of mathematics and computer science." (Marcus Chown, New Scientist, January, 2002), From the reviews: "In this book on algorithmic information theory, the author compares his concept of randomness (for recursive functions) which is based on the complexity (length) of the generating algorithm (program) with other concepts (by Martin-Löw, Solovay) and discusses its relation to incompleteness and the halting problem. Algorithms (needed for proof) are described in a (small) dialect of LISP. The style mostly is that of a lecture, lively and readable." (P. Schmitt, Monatshefte für Mathematik, Vol. 141 (1), 2004) "Chaitin is the main architect of a new branch of mathematics called algorithmic information theory, or 'AIT'. ... in Exploring Randomness, he develops algorithmic theory, further revealing its technical core. This is important work, with implications that go far beyond the arcane arguments of one branch of mathematics. ... As one gets to the substance ... it is difficult to resist Chaitin's enthusiastic style and obvious intelligence. Beyond the technicalities of the argument, the reader is quickly drawn into a fundamental new landscape of ideas." (Jacques F. Vallee, Journal of Scientific Exploration, Vol. 16 (4), 2002) "Chaitin's latest three books form a nice triangular base to support and explore the concepts underlying algorithmic information theory (AIT) - a clever blend of Gödel, Turing, and Shannon that Chaitin developed in his late teens ... . this set of three volumes packages the material in a nice, quite digestible fashion ... . Chaitin's results demonstrate that not only there is no structure to foundation of mathematics, the foundation is in fact random." (The Mathematica Journal, April, 2002) "The book is devoted to a Lisp formalism for exploring the basic ideas, concepts and results on program-size complexity and random sequences. The book contains a wealth of exercises, ranging from the 'mathematical equivalent of finger warm-ups for pianists' to substantial programming projects, from open questions to questions the author cannot even formulate. Highly recommended to anyone interested in understanding algorithmic information theory through programming." (Cristian S. Calude, Zentralblatt MATH, Vol. 963, 2002) "This book uses LISP to explore the theory of randomness, called algorithmic information theory (AIT). This is the third of Chaitin's book ... . The common theme of the books is the study of H(x), the size in bits of the smallest program for calculating x ... . Each book has a different emphasis. This book gives a detailed discussion of the metamathematical implications of these ideas and presents the technical core of Chaitin's algorithmic theory." (Book News on the Internet, October, 2001) "This is revolutionary, explosive stuff. ... Chaitin challenges readers to follow his lead and forge their own path into the black hole of randomness, the 'darkness at the edge of mathematics'. When Chaitin wrote 'explore', he well and truly meant it. An exhilarating, mind-blowing book from one of the great ideas men of mathematics and computer science." (Marcus Chown, New Scientist, January, 2002), From the reviews: "In this book on algorithmic information theory, the author compares his concept of randomness (for recursive functions) which is based on the complexity (length) of the generating algorithm (program) with other concepts (by Martin-Lw, Solovay) and discusses its relation to incompleteness and the halting problem. Algorithms (needed for proof) are described in a (small) dialect of LISP. The style mostly is that of a lecture, lively and readable." (P. Schmitt, Monatshefte fr Mathematik, Vol. 141 (1), 2004) "Chaitin is the main architect of a new branch of mathematics called algorithmic information theory, or 'AIT'. ... in Exploring Randomness, he develops algorithmic theory, further revealing its technical core. This is important work, with implications that go far beyond the arcane arguments of one branch of mathematics. ... As one gets to the substance ... it is difficult to resist Chaitin's enthusiastic style and obvious intelligence. Beyond the technicalities of the argument, the reader is quickly drawn into a fundamental new landscape of ideas." (Jacques F. Vallee, Journal of Scientific Exploration, Vol. 16 (4), 2002) "Chaitin's latest three books form a nice triangular base to support and explore the concepts underlying algorithmic information theory (AIT) - a clever blend of Gdel, Turing, and Shannon that Chaitin developed in his late teens ... . this set of three volumes packages the material in a nice, quite digestible fashion ... . Chaitin's results demonstrate that not only there is no structure to foundation of mathematics, the foundation is in fact random." (The Mathematica Journal, April, 2002) "The book is devoted to a Lisp formalism for exploring the basic ideas, concepts and results on program-size complexity and random sequences. The book contains a wealth of exercises, ranging from the 'mathematical equivalent of finger warm-ups for pianists' to substantial programming projects, from open questions to questions the author cannot even formulate. Highly recommended to anyone interested in understanding algorithmic information theory through programming." (Cristian S. Calude, Zentralblatt MATH, Vol. 963, 2002) "This book uses LISP to explore the theory of randomness, called algorithmic information theory (AIT). This is the third of Chaitin's book ... . The common theme of the books is the study of H(x), the size in bits of the smallest program for calculating x ... . Each book has a different emphasis. This book gives a detailed discussion of the metamathematical implications of these ideas and presents the technical core of Chaitin's algorithmic theory." (Book News on the Internet, October, 2001) "This is revolutionary, explosive stuff. ... Chaitin challenges readers to follow his lead and forge their own path into the black hole of randomness, the 'darkness at the edge of mathematics'. When Chaitin wrote 'explore', he well and truly meant it. An exhilarating, mind-blowing book from one of the great ideas men of mathematics and computer science." (Marcus Chown, New Scientist, January, 2002), From the reviews:"In this book on algorithmic information theory, the author compares his concept of randomness (for recursive functions) which is based on the complexity (length) of the generating algorithm (program) with other concepts (by Martin-Löw, Solovay) and discusses its relation to incompleteness and the halting problem. Algorithms (needed for proof) are described in a (small) dialect of LISP. The style mostly is that of a lecture, lively and readable." (P. Schmitt, Monatshefte für Mathematik, Vol. 141 (1), 2004)"Chaitin is the main architect of a new branch of mathematics called algorithmic information theory, or 'AIT'. … in Exploring Randomness, he develops algorithmic theory, further revealing its technical core. This is important work, with implications that go far beyond the arcane arguments of one branch of mathematics. … As one gets to the substance … it is difficult to resist Chaitin's enthusiastic style and obvious intelligence. Beyond the technicalities of the argument, the reader is quickly drawn into a fundamental new landscape of ideas." (Jacques F. Vallee, Journal of Scientific Exploration, Vol. 16 (4), 2002)"Chaitin's latest three books form a nice triangular base to support and explore the concepts underlying algorithmic information theory (AIT) a clever blend of Gödel, Turing, and Shannon that Chaitin developed in his late teens … . this set of three volumes packages the material in a nice, quite digestible fashion … . Chaitin's results demonstrate that not only there is no structure to foundation of mathematics, the foundation is in fact random." (The Mathematica Journal, April, 2002)"The book is devoted to a Lisp formalism for exploring the basic ideas, concepts and results on program-size complexity and random sequences. The book contains a wealth of exercises, ranging from the 'mathematical equivalent of finger warm-ups for pianists' to substantial programming projects, from open questions to questions the author cannot even formulate. Highly recommended to anyone interested in understanding algorithmic information theory through programming." (Cristian S. Calude, Zentralblatt MATH, Vol. 963, 2002)"This book uses LISP to explore the theory of randomness, called algorithmic information theory (AIT). This is the third of Chaitin's book … . The common theme of the books is the study of H(x), the size in bits of the smallest program for calculating x … . Each book has a different emphasis. This book gives a detailed discussion of the metamathematical implications of these ideas and presents the technical core of Chaitin's algorithmic theory." (Book News on the Internet, October, 2001)"This is revolutionary, explosive stuff. … Chaitin challenges readers to follow his lead and forge their own path into the black hole of randomness, the 'darkness at the edge of mathematics'. When Chaitin wrote 'explore', he well and truly meant it. An exhilarating, mind-blowing book from one of the great ideas men of mathematics and computer science." (Marcus Chown, New Scientist, January, 2002), From the reviews: "In this book on algorithmic information theory, the author compares his concept of randomness (for recursive functions) which is based on the complexity (length) of the generating algorithm (program) with other concepts (by Martin-L'w, Solovay) and discusses its relation to incompleteness and the halting problem. Algorithms (needed for proof) are described in a (small) dialect of LISP. The style mostly is that of a lecture, lively and readable." (P. Schmitt, Monatshefte f'r Mathematik, Vol. 141 (1), 2004) "Chaitin is the main architect of a new branch of mathematics called algorithmic information theory, or a?AITa?'. a? in Exploring Randomness, he develops algorithmic theory, further revealing its technical core. This is important work, with implications that go far beyond the arcane arguments of one branch of mathematics. a? As one gets to the substance a? it is difficult to resist Chaitina's enthusiastic style and obvious intelligence. Beyond the technicalities of the argument, the reader is quickly drawn into a fundamental new landscape of ideas." (Jacques F. Vallee, Journal of Scientific Exploration, Vol. 16 (4), 2002) "Chaitina's latest three books form a nice triangular base to support and explore the concepts underlying algorithmic information theory (AIT) a? a clever blend of G'del, Turing, and Shannon that Chaitin developed in his late teens a? . this set of three volumes packages the material in a nice, quite digestible fashion a? . Chaitina's results demonstrate that not only there is no structure to foundation of mathematics, the foundation is in fact random." (The Mathematica Journal, April, 2002) "The book is devoted to a Lisp formalism for exploring the basic ideas, concepts and results on program-size complexity and random sequences. The book contains a wealth of exercises, ranging from the a'mathematical equivalent of finger warm-ups for pianistsa? to substantial programming projects, from open questions to questions the author cannot even formulate. Highly recommended to anyone interested in understanding algorithmic information theory through programming." (Cristian S. Calude, Zentralblatt MATH, Vol. 963, 2002) "This book uses LISP to explore the theory of randomness, called algorithmic information theory (AIT). This is the third of Chaitina's book a? . The common theme of the books is the study of H(x), the size in bits of the smallest program for calculating x a? . Each book has a different emphasis. This book gives a detailed discussion of the metamathematical implications of these ideas and presents the technical core of Chaitina's algorithmic theory." (Book News on the Internet, October, 2001) "This is revolutionary, explosive stuff. a? Chaitin challenges readers to follow his lead and forge their own path into the black hole of randomness, the a'darkness at the edge of mathematicsa?'. When Chaitin wrote a'explorea?, he well and truly meant it. An exhilarating, mind-blowing book from one of the great ideas men of mathematics and computer science." (Marcus Chown, New Scientist, January, 2002)
Table of Content
I Introduction.- Historical introduction--A century of controversy over the foundations of mathematics.- What is LISP? Why do I like it'.- How to program my universal Turing machine in LISP.- II Program Size.- A self-delimiting Turing machine considered as a set of (program, output) pairs.- How to construct self-delimiting Turing machines: the Kraft inequality.- The connection between program-size complexity and algorithmic probability: H(x) = ? log2P(x) +O(1). Occam's razor: there are few minimum-size programs.- The basic result on relative complexity: H(y'x) = H(x,y)-H(x)+O(1).- III Randomness.- Theoretical interlude--What is randomness? My definitions.- Proof that Martin-Löf randomness is equivalent to Chaitin randomness.- Proof that Solovay randomness is equivalent to Martin-Löf randomness.- Proof that Solovay randomness is equivalent to strong Chaitin randomness.- IV Future Work.- Extending AIT to the size of programs for computing infinite sets and to computations with oracles.- Postscript--Letter to a daring young reader.
Copyright Date
2001
Topic
Programming Languages / General, Machine Theory, Programming / Algorithms
Lccn
00-052652
Intended Audience
Scholarly & Professional
Illustrated
Yes
Genre
Computers
Item description from the seller
Seller assumes all responsibility for this listing.
eBay item number:226141551199
Postage and handling
Item location:
Spring Hill, Florida, United States
Post to:
Afghanistan, Albania, Algeria, Andorra, Angola, Anguilla, Antigua and Barbuda, Argentina, Armenia, Aruba, Australia, Austria, Azerbaijan Republic, Bahamas, Bahrain, Bangladesh, Belgium, Belize, Benin, Bermuda, Bhutan, Bolivia, Bosnia and Herzegovina, Botswana, Brazil, Brunei Darussalam, Bulgaria, Burkina Faso, Burundi, Cambodia, Cameroon, Canada, Cape Verde Islands, Cayman Islands, Central African Republic, Chad, Chile, China, Colombia, Costa Rica, Cyprus, Czech Republic, Côte d'Ivoire (Ivory Coast), Democratic Republic of the Congo, Denmark, Djibouti, Dominican Republic, Ecuador, Egypt, El Salvador, Equatorial Guinea, Eritrea, Estonia, Ethiopia, Fiji, Finland, France, Gabon Republic, Gambia, Georgia, Germany, Ghana, Gibraltar, Greece, Greenland, Grenada, Guatemala, Guinea, Guinea-Bissau, Guyana, Haiti, Honduras, Hong Kong, Hungary, Iceland, India, Indonesia, Ireland, Israel, Italy, Jamaica, Japan, Jordan, Kazakhstan, Kenya, Kiribati, Kuwait, Kyrgyzstan, Laos, Latvia, Lebanon, Lesotho, Liberia, Liechtenstein, Lithuania, Luxembourg, Macau, Macedonia, Madagascar, Malawi, Malaysia, Maldives, Mali, Malta, Mauritania, Mauritius, Mexico, Moldova, Monaco, Mongolia, Montenegro, Montserrat, Morocco, Mozambique, Namibia, Nauru, Nepal, Netherlands, New Zealand, Nicaragua, Niger, Nigeria, Norway, Oman, Pakistan, Panama, Papua New Guinea, Paraguay, Peru, Philippines, Poland, Portugal, Qatar, Republic of Croatia, Republic of the Congo, Romania, Rwanda, Saint Kitts-Nevis, Saint Lucia, Saint Vincent and the Grenadines, San Marino, Saudi Arabia, Senegal, Serbia, Seychelles, Sierra Leone, Singapore, Slovakia, Slovenia, Solomon Islands, South Africa, South Korea, Spain, Sri Lanka, Suriname, Swaziland, Sweden, Switzerland, Taiwan, Tajikistan, Tanzania, Thailand, Togo, Tonga, Trinidad and Tobago, Tunisia, Turkey, Turkmenistan, Turks and Caicos Islands, Uganda, United Arab Emirates, United Kingdom, United States, Uruguay, Uzbekistan, Vanuatu, Vatican City State, Vietnam, Wallis and Futuna, Western Samoa, Yemen, Zambia, Zimbabwe
Excludes:
Barbados, French Guiana, French Polynesia, Guadeloupe, Libya, Martinique, New Caledonia, Reunion, Russian Federation, Ukraine, Venezuela
| Postage and handling | To | Service | Delivery*See Delivery notes |
|---|---|---|---|
| US $6.95 (approx S$ 9.37) | United States | Economy Postage (USPS Media MailTM) | Estimated between Fri, 7 Jun and Mon, 10 Jun to 43230 |
| Handling time |
|---|
| Will usually ship within 1 business day of receiving cleared payment. |
| Taxes |
|---|
| Taxes may be applicable at checkout. Learn moreLearn more about paying tax on eBay purchases. |
Sales Tax for an item #226141551199
Sales Tax for an item #226141551199
Seller collects sales tax for items shipped to the following states:
| State | Sales Tax Rate |
|---|
Return policy
| After receiving the item, contact seller within | Refund will be given as |
|---|---|
| 30 days after the buyer receives it | Money Back |
The seller is responsible for return postage costs.
Seller feedback (6,148)
h***o (29)- Feedback left by buyer.
Past month
Verified purchase
Item in perfect condition and shipped fast. Would buy from again
t***c (944)- Feedback left by buyer.
Past month
Verified purchase
Prompt service
y***e (1631)- Feedback left by buyer.
Past month
Verified purchase
Highly recommend this seller - quality product, great price, fast shipping. Thanks.