#### Filter Results:

- Full text PDF available (15)

#### Publication Year

1968

2017

- This year (2)
- Last 5 years (9)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

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

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

- Willem L. Fouché
- J. Comb. Theory, Ser. A
- 1999

In the sequel, all the graphs, posets and other ordered structures referred to will be finite. In the 1970s and 1980s, largely due to the fundamental papers by Nes etr il and Ro dl [3, 4], remarkable progress was made with the problem of determining the Ramsey objects in various classes of combinatorial configurations. We recall that if C is a class of… (More)

- Willem L. Fouché
- Discrete Mathematics
- 1997

- Willem L. Fouché
- 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. Introduction In this paper we investigate the properties of combinatorial configurations which are generated or encoded by infinite binary strings which are random in the sense of… (More)

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

- Willem L. Fouché
- Discrete Mathematics
- 1999

- I P Dannheimer, Willem L. Fouché, Cobus Nel
- South African medical journal = Suid-Afrikaanse…
- 1974

- Willem L. Fouché
- CiE
- 2009

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

Layerwise computability is an effective counterpart to continuous functions that are almosteverywhere defined. This notion was introduced by Hoyrup and Rojas [17]. A function defined on Martin-Löf random inputs is called layerwise computable, if it becomes computable if each input is equipped with some bound on the layer where it passes a fixed universal… (More)