default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWillem L. Fouché
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j18]Willem L. Fouché
, Safari Mukeru:
On local times of Martin-Löf random Brownian motion. Theor. Comput. Sci. 979: 114199 (2023)- 2022
- [i8]Willem L. Fouché, Safari Mukeru:
Local time of Martin-Lof Brownian motion. CoRR abs/2208.01877 (2022)
2010 – 2019
- 2019
- [i7]Willem L. Fouché, Hyunwoo Lee, Donghyun Lim, Sewon Park, Matthias Schröder, Martin Ziegler:
Randomized Computation of Continuous Data: Is Brownian Motion Computable? CoRR abs/1906.06684 (2019) - 2018
- [j17]Arno Pauly, Willem L. Fouché, George Davie:
Weihrauch-completeness for layerwise computability. Log. Methods Comput. Sci. 14(2) (2018) - 2017
- [j16]Andrej Bauer, Ulrich Berger, Willem L. Fouché, Dieter Spreen, Hideki Tsuiki, Martin Ziegler:
Continuity, computability, constructivity: from logic to algorithms 2014 (Preface to the special issue: Continuity, Computability, Constructivity: From Logic to Algorithms 2014). J. Log. Anal. 9 (2017) - [j15]Arno Pauly, Willem L. Fouché:
How constructive is constructing measures? J. Log. Anal. 9 (2017) - 2015
- [j14]Willem L. Fouché:
Kolmogorov complexity and the geometry of Brownian motion. Math. Struct. Comput. Sci. 25(7): 1590-1606 (2015) - [i6]Arno Pauly, George Davie, Willem L. Fouché:
Weihrauch-completeness for layerwise computability. CoRR abs/1505.02091 (2015) - 2014
- [j13]Willem L. Fouché, Safari Mukeru, George Davie:
Fourier spectra of measures associated with algorithmically random Brownian motion. Log. Methods Comput. Sci. 10(3) (2014) - [p1]Willem L. Fouché:
Diophantine properties of brownian motion: recursive aspects. Logic, Computation, Hierarchies 2014: 139-156 - [i5]Willem L. Fouché:
Kolmogorov complexity and the geometry of Brownian motion. CoRR abs/1409.1060 (2014) - [i4]Willem L. Fouché:
Diophantine properties of Brownian motion: recursive aspects. CoRR abs/1409.1752 (2014) - [i3]Arno Pauly, Willem L. Fouché:
How constructive is constructing measures? CoRR abs/1409.3428 (2014) - 2013
- [j12]George Davie, Willem L. Fouché:
On the computability of a construction of Brownian motion. Math. Struct. Comput. Sci. 23(6): 1257-1265 (2013) - [j11]Willem L. Fouché:
Martin-Löf Randomness, Invariant Measures and Countable Homogeneous Structures. Theory Comput. Syst. 52(1): 65-79 (2013) - [i2]Willem L. Fouché:
Algorithmic randomness and Ramsey properties of countable homogeneous structures. CoRR abs/1308.5506 (2013) - 2012
- [c4]Willem L. Fouché:
Algorithmic Randomness and Ramsey Properties of Countable Homogeneous Structures. WoLLIC 2012: 246-256
2000 – 2009
- 2009
- [c3]Willem L. Fouché:
Fractals Generated by Algorithmically Random Brownian Motion. CiE 2009: 208-217 - 2008
- [j10]Willem L. Fouché:
Dynamics of a generic Brownian motion: Recursive aspects. Theor. Comput. Sci. 394(3): 175-186 (2008) - [j9]Willem L. Fouché, Johannes Heidema, Glyn Jones, Petrus H. Potgieter:
Universality and programmability of quantum computers. Theor. Comput. Sci. 403(1): 121-129 (2008) - [c2]Willem L. Fouché:
Subrecursive Complexity of Identifying the Ramsey Structure of Posets. CiE 2008: 196-205 - [c1]Willem L. Fouché:
An Algorithmic Construction of Quantum Circuits of High Descriptive Complexity. CCA 2008: 61-69 - 2005
- [j8]Willem L. Fouché, Lourens M. Pretorius, Conrad Johann Swanepoel:
Ramsey degrees of bipartite graphs: A primitive recursive proof. Discret. Math. 293(1-3): 111-119 (2005) - 2004
- [i1]Willem L. Fouché, Petrus H. Potgieter:
Kolmogorov complexity and symmetric relational structures. CoRR cs.CC/0402034 (2004) - 2001
- [j7]Willem L. Fouché, Lourens M. Pretorius, Conrad Johann Swanepoel:
Partitions of factorisations of parameter words. Discret. Math. 231(1-3): 169-175 (2001) - 2000
- [j6]Willem L. Fouché:
Arithmetical Representations of Brownian Motion I. J. Symb. Log. 65(1): 421-442 (2000)
1990 – 1999
- 1999
- [j5]Willem L. Fouché:
Symmetries and Ramsey properties of trees. Discret. Math. 197-198: 325-330 (1999) - [j4]Willem L. Fouché, Lourens M. Pretorius, Conrad Johann Swanepoel:
Partition theorems for factorisations of ascending parameter words. Discret. Math. 197-198: 331-350 (1999) - [j3]Willem L. Fouché:
Symmetry and the Ramsey Degrees of Finite Relational Structures. J. Comb. Theory A 85(2): 135-147 (1999) - 1998
- [j2]Willem L. Fouché, Petrus H. Potgieter:
Kolmogorov Complexity and Symmetric Relational Structures. J. Symb. Log. 63(3): 1083-1094 (1998) - 1997
- [j1]Willem L. Fouché:
Symmetry and the Ramsey degree of posets. Discret. Math. 167-168: 309-315 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
