Computability in Europe 2006
Logical Approaches to Computational Barriers

Print current page  Print this page

Regular Talk:
Brownian motion and Kolmogorov complexity

Speaker: Willem Fouche
Presentation: talk_swansea_Jun06.pdf
Slot: Tue, 10:30-10:50, Faraday A (col. 1)

Abstract

We give a survey of the properties of Brownian motions which are
represented by infinite binary strings which are random in the sense of
Kolmogorov-Chaitin. We describe how the sensitive dynamics of such a
Brownian motion depends on the  recursive properties of the
real where the dynamics is considered. 


websites: Arnold Beckmann 2006-04-19 Valid HTML 4.01! Valid CSS! eXTReMe Tracker hit counters by www.free-counters.net