Information, Randomness and Incompleteness (häftad)
Häftad (Paperback)
Antal sidor
2 Rev ed
World Scientific Publishing Co Pte Ltd
Antal komponenter
v, 320 p. :

Information, Randomness and Incompleteness

Papers on Algorithmic Information Theory

Häftad, Engelska, 1990-01-01
498 kr
Specialorder (osäker tillgång). Skickas inom 11-20 vardagar.
Fri frakt inom Sverige för privatpersoner.
This book contains in easily accessible form all the main ideas of the creator and principal architect of algorithmic information theory. This expanded second edition has added thirteen abstracts, a 1988 Scientific American Article, a transcript of a EUROPALIA 89 lecture, an essay on biology, and an extensive bibliography. Its new larger format makes it easier to read. Chaitin's ideas are a fundamental extension of those of Godel and Turning and have exploded some basic assumptions of mathematics and thrown new light on the scientific method, epistemology, probability theory, and of course computer science and information theory.
Visa hela texten


Har du läst boken? Sätt ditt betyg »

Recensioner i media

"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

Bloggat om Information, Randomness and Incompleteness