http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
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."
Machine theory,Computational complexity,LISP ( computer program language )