Algorithmic Information Theory treats the mathematics of many important areas in digital information processing. It has been written as a read-and-learn book on concrete mathematics, for teachers, students and practitioners in electronic engineering, computer science and mathematics. The presentation is dense, and the examples and exercises are numerous. It is based on lectures on information technology (Data Compaction, Cryptography, Polynomial Coding) for engineers.

This book is purely algebraic and concentrates on cyclic homology rather than on cohomology. It attempts to single out the basic algebraic facts and techniques of the theory.The book is organized in two chapters. The first chapter deals with the intimate relation of cyclic theory to ordinary Hochschild theory. The second chapter deals with cyclic homology as a typical characteristic zero theory.

This book is purely algebraic and concentrates on cyclic homology rather than on cohomology. It attempts to single out the basic algebraic facts and techniques of the theory.The book is organized in two chapters. The first chapter deals with the intimate relation of cyclic theory to ordinary Hochschild theory. The second chapter deals with cyclic homology as a typical characteristic zero theory.

Algorithmic Information Theory treats the mathematics of many important areas in digital information processing. It has been written as a read-and-learn book on concrete mathematics, for teachers, students and practitioners in electronic engineering, computer science and mathematics. The presentation is dense, and the examples and exercises are numerous. It is based on lectures on information technology (Data Compaction, Cryptography, Polynomial Coding) for engineers.