Zobrazeno 1 - 10
of 97
pro vyhledávání: '"Spreen, Dieter"'
Working in a semi-constructive logical system that supports the extraction of concurrent programs, we extract a program inverting non-singular real valued matrices from a constructive proof based on Gaussian elimination. Concurrency is used for effic
Externí odkaz:
http://arxiv.org/abs/2305.10125
Autor:
Spreen, Dieter
Partiality is a natural phenomenon in computability that we cannot get around. So, the question is whether we can give the areas where partiality occurs, that is, where non-termination happens, more structure. In this paper we consider function class
Externí odkaz:
http://arxiv.org/abs/2305.06982
Autor:
Spreen, Dieter
The \emph{Continuity Problem} is the question whether effective operators are continuous, where an effective operator $F$ is a function on a space of constructively given objects $x$, defined by mapping construction instructions for $x$ to instructio
Externí odkaz:
http://arxiv.org/abs/2109.00914
Autor:
Spreen, Dieter, Berger, Ulrich
Publikováno v:
Logical Methods in Computer Science, Volume 19, Issue 3 (July 6, 2023) lmcs:7529
Infinite Gray code has been introduced by Tsuiki as a redundancy-free representation of the reals. In applications the signed digit representation is mostly used which has maximal redundancy. Tsuiki presented a functional program converting signed di
Externí odkaz:
http://arxiv.org/abs/2105.14261
Autor:
Spreen, Dieter
Publikováno v:
Math. Struct. Comp. Sci. 31 (2021) 144-192
A uniform approach to computing with infinite objects like real numbers, tuples of these, compacts sets, and uniformly continuous maps is presented. In work of Berger it was shown how to extract certified algorithms working with the signed digit repr
Externí odkaz:
http://arxiv.org/abs/2004.05392
Autor:
Spreen, Dieter
Information systems with witnesses have been introduced in [D. Spreen. Generalised information systems capture L-domains. arXiv:1610.02260v2] as a logic-style representation of L-domains: The category of such information systems with approximable map
Externí odkaz:
http://arxiv.org/abs/1702.05079
Autor:
Spreen, Dieter
A generalisation of Scott's information systems \cite{sco82} is presented that captures exactly all L-domains. The global consistency predicate in Scott's definition is relativised in such a way that there is a consistency predicate for each atomic p
Externí odkaz:
http://arxiv.org/abs/1610.02260
Autor:
Spreen, Dieter
The continuity problem, i.e., the question whether effective maps between effectively given topological spaces are effectively continuous, is reconsidered. In earlier work it was shown that this is always the case, if the effective map also has a wit
Externí odkaz:
http://arxiv.org/abs/1602.04125
Autor:
Berger, Ulrich, Spreen, Dieter
Exact representations of real numbers such as the signed digit representation or more generally linear fractional representations or the infinite Gray code represent real numbers as infinite streams of digits. In earlier work by the first author it w
Externí odkaz:
http://arxiv.org/abs/1510.08498