#### Filter Results:

#### Publication Year

1996

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Willem L. Fouché
- J. Symb. Log.
- 2000

- Willem L. Fouché
- Theor. Comput. Sci.
- 2008

- Arno Pauly, George Davie, Willem L. Fouché
- ArXiv
- 2015

We introduce the notion of being Weihrauch-complete for layerwise computability and provide several natural examples related to complex oscillations, the law of the iterated logarithm and Birkhoff's theorem. We also consider the hitting time operators, which share the Weihrauch degree of the former examples, but fail to be layerwise computable.

- George Davie, Willem L. Fouché
- Mathematical Structures in Computer Science
- 2013

- Willem L. Fouché
- Discrete Mathematics
- 1997

- Willem L. Fouché
- Discrete Mathematics
- 1999

- Willem L. Fouché
- CiE
- 2009

- Arno Pauly, Willem L. Fouché
- ArXiv
- 2014

Given some set, how hard is it to construct a measure supported by it? We classify some variations of this task in the Weihrauch lattice. Particular attention is paid to Frostman measures on sets with positive Hausdorff dimension. As a side result, the Weihrauch degree of Hausdorff dimension itself is determined.

- W. L. FOUCHE
- 1996

We study the Ramsey theoretic properties of combinatorial configurations which are generated by infinite binary strings which are random in the sense of Kolmogorov-Chaitin.

- Willem L. Fouché, Petrus H. Potgieter
- J. Symb. Log.
- 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.