Imagen del autor

Gregory J. Chaitin

Autor de Meta Math!: The Quest for Omega

16+ Obras 770 Miembros 10 Reseñas 1 Preferidas

Sobre El Autor

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 mostrar más 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. mostrar menos

Incluye los nombres: G. J. Chaitin, Gregory Chaitin

Créditos de la imagen: Courtesy of IBM

Obras de Gregory J. Chaitin

Obras relacionadas

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

Etiquetado

Conocimiento común

Fecha de nacimiento
1947
Género
male
Nacionalidad
Argentina
Ocupaciones
mathematician
computer scientist

Miembros

Reseñas

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.
 
Denunciada
wester | 4 reseñas más. | 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".… (más)
1 vota
Denunciada
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.
 
Denunciada
fpagan | Jan 5, 2009 |
Algorithmic complexity can not be reliably determined! Whoa. There goes several attempts at formal software development cycles.
 
Denunciada
jefware | 4 reseñas más. | Jun 7, 2008 |

También Puede Gustarte

Autores relacionados

Estadísticas

Obras
16
También por
2
Miembros
770
Popularidad
#33,051
Valoración
½ 3.5
Reseñas
10
ISBNs
50
Idiomas
4
Favorito
1

Tablas y Gráficos