Information-Theoretic Incompleteness
From MaRDI portal
Publication:5287534
DOI10.1142/1861zbMath0782.68005MaRDI QIDQ5287534
Publication date: 9 July 1993
Full work available at URL: https://doi.org/10.1142/1861
algorithmic information theory; incompleteness; randomness; Hilbert's tenth problem; halting problems
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
68-02: Research exposition (monographs, survey articles) pertaining to computer science
Related Items
LISP program-size complexity. II, Information-theoretic characterizations of recursive infinite strings, COMPLEXITY, INFORMATION, ENERGY