Literatur zur Informationserschließung

Diese Datenbank enthält über 40.000 Dokumente zu Themen aus den Bereichen Formalerschließung – Inhaltserschließung – Information Retrieval.

© 2015 W. Gödert, TH Köln, Institut für Informationswissenschaft / Powered by litecat, BIS Oldenburg (Stand: 28. April 2022)

Suchergebnisse

• 1
  Chaitin, G.J.: Algorithmic information theory.
  Cambridge : Cambridge University Press, 1987. X, 175 S.
  ISBN 0-521-34306-2
  (Cambridge tracts in theoretical computer science ; 1)
  
  Abstract: Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Gödel's incompleteness theorem, using an information theoretic approach based on the size of computer programs. One half of the book is concerned with studying the halting probability of a universal computer if its program is chosen by tossing a coin. The other half is concerned with encoding the halting probability as an algebraic equation in integers, a so-called exponential diophantine equation.
  
  Themenfeld: Information
  Wissenschaftsfach: Informatik
  
  LCSH: Machine theory ; Computational complexity ; LISP (Computer program language)
  RSWK: Algorithmus / Informatik ; Gödelscher Unvollständigkeitssatz ; Metamathematik / LISP
  BK: 54.10 (Theoretische Informatik) ; 31.02 (Philosophie und Wissenschaftstheorie der Mathematik)
  DDC: 006.31
  Eppelsheimer: Mat T 1068 / Informationstheorie
  GHBS: TVB (E) ; TVI (HA)
  LCC: QA267
  RVK: SK 130