rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Algorithmic information theory
  title info: title
  name:
    name part: Chaitin, Gregory J.
    role:
      role term: creator
  type of resource: text
  origin info:
    place:
      place term: xx
    place:
      place term: Cambridge, UK
    publisher: Cambridge University Press
    date issued: 2004
    date issued: 9999
    issuance: monographic
  language:
    language term: und
  physical description:
    form: print
  abstract: The inventor of algorithmic information theory, presents in this book the strongest possible version of Godel's incompleteness theorem, using an information theoretic approach based on the size of computer programs." This slim but highly original (and frequently lively) monograph brings to mind the (related) work of Godel and of Turing; it is methodologically/stylistically idiosyncratic, and addressed to the clarification of some deeply fundamental issues"the nature of randomness and the limitations of the axiomatic method."
  note: Gregory J. Chaitin
  subject:
    topic: Machine theory,Computational complexity,LISP ( computer program language )
  classification: 006.31
  classification: C435
  record info:
    record creation date: 210402
    record identifier: CTU_116884