15 Ergebnisse.

La teoria dell'evoluzione delle specie per selezione naturale è una delle grandi rivoluzioni culturali dell'ultimo secolo e mezzo, una teoria la cui validità è stata dimostrata da un'infinità di conferme empiriche. Con buona pace di creazionisti e sostenitori di disegni (più o meno) intelligenti. Gregory Chaitin ha deciso di mettere ancora una volta "Darwin alla prova", e ha sfidato se stesso a elaborare un modello matematico dell'evoluzione, ...

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 G del and Turning a...

This essential companion to Chaitin's successful books The Unknowable and The Limits of Mathematics, presents the technical core of his theory of program-size complexity. The two previous volumes are more concerned with applications to meta-mathematics. LISP is used to present the key algorithms and to enable computer users to interact with the authors proofs and discover for themselves how they work. The LISP code for this book is available a...

In this mathematical autobiography, Chaitin presents a technical survey of his work and a non-technical discussion of its significance. The volume is a companion to the earlier collection of Chaitin's papers "Information, Randomness and Incompleteness" also published by World Scientific.

As a teenager, Greg created independently of Kolmogorov and Solomonoff, what we call today algorithmic information theory, a sub­ ject of which he is the main architect. His 1965 paper on gedanken experiments on automata, which he wrote when he was in high school, is still of interest today. He was also heavily involved in IBM, where he has worked for almost thirty years, on the development of RISC technology. Greg's results are widely quoted....

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...

This essential companion to Chaitin's successful books The Unknowable and The Limits of Mathematics, presents the technical core of his theory of program-size complexity. The two previous volumes are more concerned with applications to meta-mathematics. LISP is used to present the key algorithms and to enable computer users to interact with the authors proofs and discover for themselves how they work. The LISP code for this book is available a...

Expounds G del's incompleteness theorey using an information theoretic approach based on the size of computer programs.

Tutta la scienza d'Occidente poggia sulla matematica, ma sin dagli anni Trenta i matematici sono divenuti penosamente consapevoli del fatto che la loro disciplina soffre di serie limitazioni. Gregory Chaitin ne ha ampliato il concetto, sostenendo che vi sono molte condizioni dove le verità non possono essere dimostrate da alcuna regola a priori. Il matematico ha trovato nel numero Omega il concetto chiave per confermare l'incompletezza della s...

In this mathematical autobiography, Chaitin presents a technical survey of his work and a non-technical discussion of its significance. The volume is a companion to the earlier collection of Chaitin's papers "Information, Randomness and Incompleteness" also published by World Scientific.

Dr Gregory Chaitin, one of the world's leading mathematicians, is best known for his discovery of the remarkable O number, a concrete example of irreducible complexity in pure mathematics which shows that mathematics is infinitely complex. In this volume, Chaitin discusses the evolution of these ideas, tracing them back to Leibniz and Borel as well as G¿del and Turing.This book contains 23 non-technical papers by Chaitin, his favorite tutorial...

Dr Gregory Chaitin, one of the world's leading mathematicians, is best known for his discovery of the remarkable O number, a concrete example of irreducible complexity in pure mathematics which shows that mathematics is infinitely complex. In this volume, Chaitin discusses the evolution of these ideas, tracing them back to Leibniz and Borel as well as G¿del and Turing.This book contains 23 non-technical papers by Chaitin, his favorite tutorial...

The author, G. J. Chaitin, shows that God plays dice not only in quantum mechanics but also in the foundations of mathematics. According to Chaitin there exist mathematical facts that are true for no reason. This fascinating and provocative text contains a collection of his most wide-ranging and non-technical lectures and interviews. It will be of interest to anyone concerned with the philosophy of mathematics, the similarities and differences...

This essential companion to Chaitins highly successful The Limits of Mathematics, gives a brilliant historical survey of important work on the foundations of mathematics. The Unknowable is a very readable introduction to Chaitins ideas, and includes software (on the authors website) that will enable users to interact with the authors proofs. "Chaitins new book, The Unknowable, is a welcome addition to his oeuvre. In it he manages to bring his ...

As a teenager, Greg created independently of Kolmogorov and Solomonoff, what we call today algorithmic information theory, a sub­ ject of which he is the main architect. His 1965 paper on gedanken experiments on automata, which he wrote when he was in high school, is still of interest today. He was also heavily involved in IBM, where he has worked for almost thirty years, on the development of RISC technology. Greg's results are widely quoted....