Bild på författaren.

Gregory J. Chaitin

Författare till Meta Math!: The Quest for Omega

16+ verk 771 medlemmar 10 recensioner 1 favoritmärkta

Om författaren

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 visa mer 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. visa färre

Inkluderar namnen: G. J. Chaitin, Gregory Chaitin

Foto taget av: Courtesy of IBM

Verk av Gregory J. Chaitin

Associerade verk

New Directions in the Philosophy of Mathematics (1985) — Bidragsgivare — 55 exemplar
Alan Turing: His Work and Impact (2013) — Bidragsgivare — 36 exemplar

Taggad

Allmänna fakta

Födelsedag
1947
Kön
male
Nationalitet
Argentina
Yrken
mathematician
computer scientist

Medlemmar

Recensioner

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.
 
Flaggad
wester | 4 andra recensioner | 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".… (mer)
1 rösta
Flaggad
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.
 
Flaggad
fpagan | Jan 5, 2009 |
Algorithmic complexity can not be reliably determined! Whoa. There goes several attempts at formal software development cycles.
 
Flaggad
jefware | 4 andra recensioner | Jun 7, 2008 |

Du skulle kanske också gilla

Associerade författare

Statistik

Verk
16
Även av
2
Medlemmar
771
Popularitet
#33,006
Betyg
½ 3.4
Recensioner
10
ISBN
50
Språk
4
Favoritmärkt
1

Tabeller & diagram