Randomness and Complexity, from Leibniz to Chaitin
Cristian S. Calude, Cristian S. Calude
The book is a collection of papers written by a selection of eminent authors from around the world in honour of Gregory Chaitin's 60th birthday. This is a unique volume including technical contributions, philosophical papers and essays.
Besides computer scientists, Chaitin's work draws attention of many philosophers and mathematicians to fundamental problems in mathematical creativity and digital philosophy.
(source: Wikipedia)
Gregory John Chaitin (born 25 June 1947) is an Argentine-American mathematician and computer scientist. Beginning in the late 1960s, Chaitin made contributions to algorithmic information theory and metamathematics, in particular a computer-theoretic result equivalent to Gödel's incompleteness theorem. He is considered to be one of the founders of what is today known as algorithmic (Solomonoff–Kolmogorov–Chaitin, Kolmogorov or program-size) complexity together with Andrei Kolmogorov and Ray Solomonoff.
Along with the works of e.g. Solomonoff, Kolmogorov, Martin-Löf, and Leonid Levin, algorithmic information theory became a foundational part of theoretical computer science, information theory, and mathematical logic. It is a common subject in several computer science curricula.Besides computer scientists, Chaitin's work draws attention of many philosophers and mathematicians to fundamental problems in mathematical creativity and digital philosophy.
(source: Wikipedia)
Categorias:
Ano:
2007
Editora:
World Scientific Publishing Company
Idioma:
english
Páginas:
466
ISBN 10:
9812770828
ISBN 13:
9789812770820
Arquivo:
PDF, 22.91 MB
IPFS:
,
english, 2007