Photo de l'auteur

Gregory J. Chaitin

Auteur de Meta Math!: The Quest for Omega

16+ oeuvres 770 utilisateurs 10 critiques 1 Favoris

A propos de l'auteur

Gregory Chaitin is an Argentinian-American mathematician and computer scientist. The author of many books and scholarly papers, Chaitin proved the Gdel-Chaitin incompleteness theorem and is. the discoverer of the remarkable Omega number, which shows that God plays dice in pure mathematics. Newton afficher plus da Costa is a Brazilian logician whose best known contributions have been in the realms of nonclassical logics and philosophy of science. Da Costa developed paraconsistent logics, that is, logical systems that admit inner contradictions. Francisco Antonio Doria is a Brazilian physicist. He has made contributions to the gauge field copy problem in quantum field theory and proved with Newton da Costa several incompleteness theorems in mathematics, physics and mathematical economics, including the undecidability of chaos theory. afficher moins

Comprend les noms: G. J. Chaitin, Gregory Chaitin

Crédit image: Courtesy of IBM

Œuvres de Gregory J. Chaitin

Oeuvres associées

New Directions in the Philosophy of Mathematics (1985) — Contributeur — 56 exemplaires
Alan Turing: His Work and Impact (2013) — Contributeur — 36 exemplaires

Étiqueté

Partage des connaissances

Date de naissance
1947
Sexe
male
Nationalité
Argentina
Professions
mathematician
computer scientist

Membres

Critiques

I want to read this book but I'm put off by the amount of exclamation marks. I do like enthousiasm but this is overdoing it.
 
Signalé
wester | 4 autres critiques | Apr 12, 2016 |
"Metabiology": Chaitin, whose version of algorithmic information theory revealed the full extent of the limitations of pre-Gödel and pre-Turing mathematics, in these remarkable 123 pages and in his usual free-wheeling ("creative") way describes a mathematical model for investigating the theoretical effectiveness of Darwinian evolution. In the model, the genomes of organisms take the form of the bit-sequences of certain computer programs, and fitness for survival is represented by the computational power (precisely defined) of those programs. Chaitin has proved that the time complexity for the process of producing higher-"fitness" programs is between N^2 and N^3 when the process is one of cumulative random mutations, this being vastly better than that (2^N) for non-cumulative random mutations and almost as good as that (N) for the imaginary limit of "intelligent design".… (plus d'informations)
1 voter
Signalé
fpagan | Jul 16, 2012 |
The "halting probability" Omega, the ultimate in oracular and uncomputable numbers, is the sum of terms 2^(-|P|) for all halting programs P, where |P| is the length of P in bits. This congenial compendium of Chaitin's easier writings and lecture transcripts might be the best vehicle for Jane and Joe Generalist to learn about his remarkable contributions to metamathematics.
 
Signalé
fpagan | Jan 5, 2009 |
Algorithmic complexity can not be reliably determined! Whoa. There goes several attempts at formal software development cycles.
 
Signalé
jefware | 4 autres critiques | Jun 7, 2008 |

Vous aimerez peut-être aussi

Auteurs associés

Statistiques

Œuvres
16
Aussi par
2
Membres
770
Popularité
#33,051
Évaluation
½ 3.5
Critiques
10
ISBN
50
Langues
4
Favoris
1

Tableaux et graphiques