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.
"synopsis" may belong to another edition of this title.
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)
"About this title" may belong to another edition of this title.
Seller: Half Price Books Inc., Dallas, TX, U.S.A.
Hardcover. Condition: Very Good. Connecting readers with great books since 1972! Used books may not include companion materials, and may have some shelf wear or limited writing. We ship orders daily and Customer Service is our top priority! Seller Inventory # S_465087692
Seller: Looking for Books?, CORPUS CHRISTI, TX, U.S.A.
Hardcover. Condition: Very Good. Dust Jacket Condition: Very Good+. Book is clean and tight. Corners are bumped. Mathematics and Computer Science. ; Discrete Mathematics And Theoretical Computer Science; 6.25 X 0.75 X 9 inches; 164 pages. Seller Inventory # 9504
Seller: HPB-Red, Dallas, TX, U.S.A.
Hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Seller Inventory # S_434683520
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 180. Seller Inventory # 26299498
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. pp. 180 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam. Seller Inventory # 7548469
Quantity: 1 available
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. pp. 180. Seller Inventory # 18299488
Quantity: 1 available
Seller: Fireside Bookshop, Stroud, GLOS, United Kingdom
Cloth. Condition: Very Good. Dust Jacket Condition: Very Good. Third Printing. Type: Book N.B. Secondhand POD copy. Small plain label to front paste down. Seller Inventory # 052002
Quantity: 1 available
Seller: Mooney's bookstore, Den Helder, Netherlands
Condition: Very good. Seller Inventory # E-9781852334178-2-2
Quantity: 1 available
Seller: Burwood Books, Wickham Market, United Kingdom
Hardcover. Condition: Fine. First Edition. Hardback. Dust Jacket. 8vo.pp. 165. Original publisher's binding in black, lettered gilt at spine. Dust jacket in bright glossy blue, lettered black and orange with a colour photograph of a romantic landscape in the setting sun. ISBN13:1852334177. Fine in fine dust jacket. Seller Inventory # C104602
Quantity: 1 available
Seller: Rotary Charity Books, Albert Park, VIC, Australia
Hardcover. Condition: As New. Dust Jacket Condition: As New. 1st Edition. Condition of Hardback Book and Dustjacket: As New 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 of trivial "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 off into 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. Industry 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-Low, 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 fur 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 Godel, 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) 164pp. Seller Inventory # 1828
Quantity: 1 available