Algebraic and analytic randomness.

From MaRDI portal





In this paper the author addresses the question of giving a formal universal definition of a random sequence. He starts by laying down three \`\` principles, or intuitive properties that a sequence should possess in order to be considered random; the first such principle is actually the (disputable) assertion that no formal definition of randomness exists in mathematics yet. Then he sets out to give several potentially useful measures of randomness, of algebraic and analytic nature. He supports his choice by some examples, and various results that interconnect those measures. As a matter of fact, the quest for a formal definition of randomness is not new in mathematics. In his famous book \`\` The Art of Computer Programming [Vol. 2: Seminumerical Algorithms, Section 3.5 (Addison-Wesley, Reading (1969; Zbl 0191.18001)] \textit{D. E. Knuth} discussed the matter in detail, and claimed to have given a formal definition of a random sequence; at least it is a definition that satisfies all the principles stated in the paper. Unfortunately, the paper fails to mention that important milestone, as well as earlier references cited by Knuth. For the entire collection see [Zbl 0979.00040].











This page was built for publication: Algebraic and analytic randomness.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4549573)