Computability on random variables
✍ Scribed by Norbert Th. Müller
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 834 KB
- Volume
- 219
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
✦ Synopsis
In this paper, we study aspects of computability concerning random variables under the background of Type 2 Theory of Effectivity (TTE). We show that the resulting definitions are "natural" as they suffice to successfully discuss questions of computability of basic queueing systems, e.g. of the so-called M/G/l-system.
📜 SIMILAR VOLUMES
We investigate some ways to obtain free families of random variables from an initial free family in a tracial noncommutative probability space. The random variables in this initial free family are multiplied on the left and the right by certain operators from an algebra free from the entire family.