-
2Kolmogorov Complexity and Symmetric Relational StructuresJournal of Symbolic Logic 63 (3): 1083-1094. 1998.We study partitions of Fraisse limits of classes of finite relational structures where the partitions are encoded by infinite binary strings which are random in the sense of Kolmogorov-Chaitin.
-
13Diophantine properties of brownian motion: recursive aspectsIn Dieter Spreen, Hannes Diener & Vasco Brattka (eds.), Logic, Computation, Hierarchies, De Gruyter. pp. 139-156. 2014.
-
33Kolmogorov complexity and symmetric relational structuresJournal of Symbolic Logic 63 (3): 1083-1094. 1998.We study partitions of Fraïssé limits of classes of finite relational structures where the partitions are encoded by infinite binary strings which are random in the sense of Kolmogorov-Chaitin
-
7Arithmetical Representations of Brownian Motion IJournal of Symbolic Logic 65 (1): 421-442. 2000.We discuss ways in which a typical one-dimensional Brownian motion can be approximated by oscillations which are encoded by finite binary strings of high descriptive complexity. We study the recursive properties of Brownian motions that can be thus obtained.
-
45Arithmetical representations of brownian motion IJournal of Symbolic Logic 65 (1): 421-442. 2000.We discuss ways in which a typical one-dimensional Brownian motion can be approximated by oscillations which are encoded by finite binary strings of high descriptive complexity. We study the recursive properties of Brownian motions that can be thus obtained
Pretoria, Gauteng, South Africa