Thinking about Gödel and Turing : essays on complexity 1970-2007 /

Saved in:

Bibliographic Details
Author / Creator:	Chaitin, Gregory J.
Imprint:	Hackensack, N.J. : World Scientific, ©2007.
Description:	1 online resource (xix, 347 pages)
Language:	English
Subject:	Gödel's theorem. Incompleteness theorems. Logic, Symbolic and mathematical. Metamathematics. Computational complexity. Computational complexity. Gödel's theorem. Incompleteness theorems. Logic, Symbolic and mathematical. Metamathematics. Electronic books.
Format:	E-Resource Book
URL for this record:	http://pi.lib.uchicago.edu/1001/cat/bib/11170441

Hidden Bibliographic Details
Varying Form of Title:	Gödel and Turing
ISBN:	9789812708977 9812708979 9789812708960 9812708960 9789812708953 9812708952
Notes:	Includes bibliographical references and index. Print version record.
Summary:	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 Gödel and Turing. This book contains 23 non-technical papers by Chaitin, his favorite tutorial and survey papers, including Chaitin's three Scientific American articles. These essays summarize a lifetime effort to use the notion of program-size co.
Other form:	Print version: Chaitin, Gregory J. Thinking about Gödel and Turing. Hackensack, N.J. : World Scientific, ©2007 9789812708960

Similar Items