Building upon the known generalized-quantifier-based first-order characterization of LOGCFL, we lay the groundwork for a deeper investigation. Specifically, we examine subclasses of LOGCFL arising from varying the arity and nesting of groupoidal quantifiers in first-order logic with linear order. Ou
The Descriptive Complexity of Brownian Motion
✍ Scribed by Willem L. Fouché
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 205 KB
- Volume
- 155
- Category
- Article
- ISSN
- 0001-8708
No coin nor oath required. For personal study only.
✦ Synopsis
A continuous function x on the unit interval is a generic Brownian motion when every probabilistic event which holds almost surely with respect to the Wiener measure is reflected in x, provided that the event has a suitably effective description. We show that a generic one-dimensional Brownian motion can be computed from an infinite binary string which is complex in the sense of Kolmogorov Chaitin. Conversely, one can construct a Kolmogorov Chaitin random string from the values at the rational numbers of a generic Brownian motion. In this way, we construct a recursive isomorphism between encoded versions of generic Brownian motions and Kolmogorov Chaitin random reals.
📜 SIMILAR VOLUMES
Modeling the highly inelastic interactions inside hair, and between the hair and the character body, is a determinant feature for achieving realistic hair animation. However, the extremely large number of hair strands has so far prevented animators from handling these interactions. It is also unclea
For infinitesimal data given on the group of diffeomorphism of the circle with respect to the metric H 3=2 , the associated Brownian motion has been constructed by Malliavin (C.R. Acad. Sci. Paris t. 329 (1999), 325-329). In this work, we shall give another approach and prove the invariance of heat