#### Filter Results:

- Full text PDF available (36)

#### Publication Year

1981

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Dieter Spreen, Rhada Jagadeesan, +5 authors Jon Riecke
- 1996

The aim of this thesis is to give a new understanding of sequential computations in higher types. We present a new computation model for higher types based on a game describing the interaction between a functional and its arguments. The functionals which may be described in this way are called hereditarily sequential. We show that this computation model… (More)

- Dieter Spreen
- J. Symb. Log.
- 1998

- Dieter Spreen
- Inf. Comput.
- 1995

- Dieter Spreen
- Ann. Pure Appl. Logic
- 1996

Effective inseparability of pairs of sets is an important notion in logic and computer science. We study the effective inseparability of sets which appear as index sets of subsets of an effectively given topological To-space and discuss its consequences. It is shown that for two disjoint subsets X and Y of the space one can effectively find a witness that… (More)

- Dieter Spreen, Luoshan Xu, Xuxin Mao
- Theor. Comput. Sci.
- 2008

- Dieter Spreen
- Theor. Comput. Sci.
- 2001

This paper gives an answer to Weihrauch's question [31] whether and, if not always, when an effective map between the computable elements of two represented sets can be extended to a (partial) computable map between the represented sets. Examples are known showing that this is not possible in general. A condition is introduced and for countably based… (More)

- Dieter Spreen
- Electr. Notes Theor. Comput. Sci.
- 2008

If one wants to compute with infinite objects like real numbers or data streams, continuity is a necessary requirement: better and better (finite) approximations of the input are transformed in better and better (finite) approximations of the output. In case the objects are constructively generated, they can be represented by a finite description of the… (More)

- Dieter Spreen
- J. Symb. Log.
- 2001

In examples like the total recursive functions or the computable real numbers the canonical indexings are only partial maps. It is even impossible in these cases to nd an equivalent total numbering. We consider eeectively given topological T0-spaces and study the problem in which cases the canonical numberings of such spaces can be totalized, i. e., have an… (More)

There have been many suggestions for what should be a computable real number or function. Some of them exhibited pathological properties. At present, research concentrates either on an application of Weihrauch's Type Two Theory of Effectivity or on domain-theoretic approaches, in which case the partial objects appearing during computations are made… (More)

- Dieter Spreen
- DMTCS
- 1996