Year: 1987
Title: Algorithmic Information Theory
Publisher: Cambridge University Press ,Cambridge, pages:
Comments: Using algoriothmic information (or Kolmogorov complexity) proves there are mathematical statements whose behaviour is essentiall random (not formalisable).
Keywords: INFORMATION, COMPUTABILITY, KOLMOGOROV, COMPLEXITY,
| Top | Authors | Journals | Years | Keywords | Search | New | Comments |