Discrete Mathematics and Theoretical Computer Science

Exploring RANDOMNESS

Authors: Chaitin, Gregory J.

Buy this book

eBook $99.00
price for USA (gross)
  • ISBN 978-1-4471-0307-3
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $169.00
price for USA
  • ISBN 978-1-85233-417-8
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $129.00
price for USA
  • ISBN 978-1-4471-1085-9
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

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.

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)


Table of contents (13 chapters)

  • Historical introduction — A century of controversy over the foundations of mathematics

    Chaitin, Gregory J.

    Pages 3-28

  • What is LISP? Why do I like it?

    Chaitin, Gregory J.

    Pages 29-43

  • How to program my universal Turing machine in LISP

    Chaitin, Gregory J.

    Pages 45-59

  • A self-delimiting Turing machine considered as a set of (program, output) pairs

    Chaitin, Gregory J.

    Pages 63-72

  • How to construct self-delimiting Turing machines: the Kraft inequality

    Chaitin, Gregory J.

    Pages 73-83

Buy this book

eBook $99.00
price for USA (gross)
  • ISBN 978-1-4471-0307-3
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $169.00
price for USA
  • ISBN 978-1-85233-417-8
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $129.00
price for USA
  • ISBN 978-1-4471-1085-9
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Exploring RANDOMNESS
Authors
Series Title
Discrete Mathematics and Theoretical Computer Science
Copyright
2001
Publisher
Springer-Verlag London
Copyright Holder
Springer-Verlag London
eBook ISBN
978-1-4471-0307-3
DOI
10.1007/978-1-4471-0307-3
Hardcover ISBN
978-1-85233-417-8
Softcover ISBN
978-1-4471-1085-9
Edition Number
1
Number of Pages
X, 164
Topics