Abstract. We introduce a generic algorithmic technique and apply it on decision and counting versions of graph coloring. Our approach is based on the following idea: either a graph...
The weakly random reals contain not only the Schnorr random reals as a subclass but also the weakly 1-generic reals and therefore the n-generic reals for every n. While the class o...
Abstract We present an analog and machine-independent algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis: we p...
We develop a domain theory for treating recursive types with respect to contextual equivalence. The principal approach taken here deviates from classical domain theory in that we ...
The development of complex software requires the implementation of functions over a variety of recursively defined data structures. The design (and modeling) of structures can it...