Computer Science – Computational Complexity
Scientific paper
2012-02-17
LMCS 8 (1:23) 2012
Computer Science
Computational Complexity
11 pages
Scientific paper
10.2168/LMCS-8(1:23)2012
By considering a counting-type argument on Brownian sample paths, we prove a result similar to that of Orey and Taylor on the exact Hausdorff dimension of the rapid points of Brownian motion. Because of the nature of the proof we can then apply the concepts to so-called complex oscillations (or 'algorithmically random Brownian motion'), showing that their rapid points have the same dimension.
No associations
LandOfFree
The rapid points of a complex oscillation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The rapid points of a complex oscillation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The rapid points of a complex oscillation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-35450