Willem L. Fouché

Orcid: 0000-0003-0445-4221

According to our database1, Willem L. Fouché authored at least 26 papers between 1997 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
On local times of Martin-Löf random Brownian motion.
Theor. Comput. Sci., November, 2023

2022
Local time of Martin-Lof Brownian motion.
CoRR, 2022

2019
Randomized Computation of Continuous Data: Is Brownian Motion Computable?
CoRR, 2019

2018
Weihrauch-completeness for layerwise computability.
Log. Methods Comput. Sci., 2018

2017
How constructive is constructing measures?
J. Log. Anal., 2017

Continuity, computability, constructivity: from logic to algorithms 2014 (Preface to the special issue: Continuity, Computability, Constructivity: From Logic to Algorithms 2014).
J. Log. Anal., 2017

2015
Kolmogorov complexity and the geometry of Brownian motion.
Math. Struct. Comput. Sci., 2015

2014
Fourier spectra of measures associated with algorithmically random Brownian motion.
Log. Methods Comput. Sci., 2014

Diophantine properties of Brownian motion: recursive aspects.
CoRR, 2014

Diophantine properties of brownian motion: recursive aspects.
Proceedings of the Logic, Computation, Hierarchies, 2014

2013
Martin-Löf Randomness, Invariant Measures and Countable Homogeneous Structures.
Theory Comput. Syst., 2013

On the computability of a construction of Brownian motion.
Math. Struct. Comput. Sci., 2013

2012
Algorithmic Randomness and Ramsey Properties of Countable Homogeneous Structures.
Proceedings of the Logic, Language, Information and Computation, 2012

2009
Fractals Generated by Algorithmically Random Brownian Motion.
Proceedings of the Mathematical Theory and Computational Practice, 2009

2008
Universality and programmability of quantum computers.
Theor. Comput. Sci., 2008

Dynamics of a generic Brownian motion: Recursive aspects.
Theor. Comput. Sci., 2008

An Algorithmic Construction of Quantum Circuits of High Descriptive Complexity.
Proceedings of the Fifth International Conference on Computability and Complexity in Analysis, 2008

Subrecursive Complexity of Identifying the Ramsey Structure of Posets.
Proceedings of the Logic and Theory of Algorithms, 2008

2005
Ramsey degrees of bipartite graphs: A primitive recursive proof.
Discret. Math., 2005

2001
Partitions of factorisations of parameter words.
Discret. Math., 2001

2000
Arithmetical Representations of Brownian Motion I.
J. Symb. Log., 2000

1999
Symmetry and the Ramsey Degrees of Finite Relational Structures.
J. Comb. Theory A, 1999

Partition theorems for factorisations of ascending parameter words.
Discret. Math., 1999

Symmetries and Ramsey properties of trees.
Discret. Math., 1999

1998
Kolmogorov Complexity and Symmetric Relational Structures.
J. Symb. Log., 1998

1997
Symmetry and the Ramsey degree of posets.
Discret. Math., 1997


  Loading...