**Measure-Preserving Systems**

by Karl Petersen

**Publisher**: University of North Carolina 2008**Number of pages**: 65

**Description**:

These notes provide an introduction to the subject of measure-preserving dynamical systems, discussing the dynamical viewpoint; how and from where measure-preserving systems arise; the construction of measures and invariant measures; some basic constructions within the class of measure-preserving systems; and some mathematical background on conditional expectations, Lebesgue spaces, and disintegrations of measures.

Download or read it online for free here:

**Download link**

(510KB, PDF)

## Similar books

**Introduction to Computational Complexity**

by

**Martin Tompa**

Lecture notes for a graduate course on computational complexity taught at the University of Washington. Alternating Turing machines are introduced very early, and deterministic and nondeterministic Turing machines treated as special cases.

(

**5861**views)

**Algorithmic Randomness and Complexity**

by

**R. G. Downey, D. R. Hirschfeldt**-

**Springer**

Computability and complexity theory are two central areas of research in theoretical computer science. This book provides a systematic, technical development of algorithmic randomness and complexity for scientists from diverse fields.

(

**5386**views)

**From Complexity to Creativity**

by

**Ben Goertzel**-

**Plenum Press**

This text applies the concepts of complexity science to provide an explanation of all aspects of human creativity. The book describes the model that integrates ideas from computer science, mathematics, neurobiology, philosophy, and psychology.

(

**10535**views)

**Specifying Systems**

by

**Leslie Lamport**-

**Addison-Wesley Professional**

This book shows how to write unambiguous specifications of complex computer systems. It provides a complete reference manual for the TLA+, the language developed by the author for writing simple and elegant specifications of algorithms and protocols.

(

**9688**views)