s p o n s o r e d   l i n k s

Algorithmic Information Theory.pdf

Taken from Foreword: Turing’s deep 1937 paper made it clear that G¨odel’s astonishing earlier
results on arithmetic undecidability related in a very natural way to a class of computing automata, nonexistent at the time of Turing’s paper, but destined to appear only a few years later, subsequently to proliferate as the ubiquitous stored-program computer of today. The appearance of computers, and the involvement of a large scienti c community in elucidation of their properties and limitations, greatly enriched the line of thought opened by Turing. Turing’s distinction between computational problems was rawly binary: some were solvable by algorithms, others not. Later work, of which an attractive part is elegantly developed in the present volume, re ned this into a multiplicity of scales of computational difficulty, which is still developing as a fundamental theory of information and computation that plays much the same role in computer science that classical thermodynamics plays in physics: by de ning the outer limits of the possible, it prevents designers of algorithms from trying to create computational structures which provably do not exist. It is not surprising that such a thermodynamics of information should be as rich in philosophical consequence as thermodynamics itself.

s p o n s o r e d   l i n k s


Learning to Program.pdf

April 16, 2007 · Filed Under Other Programming Ebooks · 2 Comments  · Tags: ,

Once you can program in one language you can easily pick up a new one in a few days. Why those languages? Well, for a start they have very different styles to Python so form a useful contrast.