Algorithmic information theory

Journal of Symbolic Logic 54 (4):1389-1400 (1989)
  Copy   BIBTEX

Abstract

We present a critical discussion of the claim (most forcefully propounded by Chaitin) that algorithmic information theory sheds new light on Godel's first incompleteness theorem

Categories

Keywords

Reprint years

DOI

10.2307/2274821

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Is Evolution Algorithmic?Marcin Miłkowski - 2009 - Minds and Machines 19 (4):465-475.
How to Run Algorithmic Information Theory on a Computer.G. J. Chaitin - unknown
A note on Monte Carlo primality tests and algorithmic information theory.Jacob T. Schwartz - unknown
Algorithmic information theory and undecidability.Panu Raatikainen - 2000 - Synthese 123 (2):217-225.
Information Processing as an Account of Concrete Digital Computation.Nir Fresco - 2013 - Philosophy and Technology 26 (1):31-60.
Algorithmic randomness in empirical data.James W. McAllister - 2003 - Studies in History and Philosophy of Science Part A 34 (3):633-646.
Leibniz, Information, Math and Physics.G. J. Chaitin - unknown
Kolmogorov complexity and information theory. With an interpretation in terms of questions and answers.Peter D. Grünwald & Paul M. B. Vitányi - 2003 - Journal of Logic, Language and Information 12 (4):497-529.

Analytics

Added to PP
2009-01-28

Downloads
100 (#170,192)

6 months
32 (#101,267)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Michiel Van Lambalgen
University of Amsterdam

Citations of this work

On interpreting Chaitin's incompleteness theorem.Panu Raatikainen - 1998 - Journal of Philosophical Logic 27 (6):569-586.
Randomness by design.William A. Dembski - 1991 - Noûs 25 (1):75-106.
Exploring Randomness.Panu Raatikainen - 2001 - Notices of the AMS 48 (9):992-6.

View all 12 citations / Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Reflection Principles and Their Use for Establishing the Complexity of Axiomatic Systems.Georg Kreisel & Azriel Lévy - 1968 - Zeitschrift für Mathematische Logic Und Grundlagen der Mathematik 14 (1):97--142.

Add more references