Willem L. Fouché

Learn More
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)
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)