Information, Randomness And Incompleteness: Papers On Algorithmic Information Theory (2nd Edition)

Author:   Gregory J Chaitin (Ibm Thomas J Watson Research Ctr, Usa)
Publisher:   World Scientific Publishing Co Pte Ltd
Edition:   2nd Revised edition
Volume:   8
ISBN:  

9789810201548


Pages:   324
Publication Date:   01 January 1990
Format:   Hardback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $343.20 Quantity:  
Add to Cart

Share |

Information, Randomness And Incompleteness: Papers On Algorithmic Information Theory (2nd Edition)


Add your own review!

Overview

Full Product Details

Author:   Gregory J Chaitin (Ibm Thomas J Watson Research Ctr, Usa)
Publisher:   World Scientific Publishing Co Pte Ltd
Imprint:   World Scientific Publishing Co Pte Ltd
Edition:   2nd Revised edition
Volume:   8
ISBN:  

9789810201548


ISBN 10:   9810201540
Pages:   324
Publication Date:   01 January 1990
Audience:   College/higher education ,  Professional and scholarly ,  Postgraduate, Research & Scholarly ,  Professional & Vocational
Format:   Hardback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

Reviews

One will find [Information, Randomness and Incompleteness] all kinds of articles which are popularizations or epistemological reflections and presentations which permit one to rapidly obtain a precise idea of the subject and of some of its applications (in particular in the biological domain). Very complete, it is recommended to anyone who is interested in algorithmic information theory. (translated) Jean-Paul Delahaye in La Recherche No one, but no one, is exploring to greater depths the amazing insights and theorems that flow from Godel's work on undecidability than Gregory Chaitin. His exciting discoveries and speculations invade such areas as logic, induction, simplicity, the philosophy of mathematics and science, randomness, proof theory, chaos, information theory, computer complexity, diophantine analysis and even the origin and evolution of life. Martin Gardner Gregory Chaitin ... has proved the ultimate in undecidability theorems ..., that the logical structure of arithmetic can be random ... The assumption that the formal structure of arithmetic is precise and regular turns out to have been a time-bomb and Chaitin has just pushed the detonator. Ian Stewart in Nature


Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List