License
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.7.11.142
URN: urn:nbn:de:0030-drops-86826
URL: http://drops.dagstuhl.de/opus/volltexte/2018/8682/
Go back to Dagstuhl Reports


Müller, Norbert T. ; Rump, Siegfried M. ; Weihrauch, Klaus ; Ziegler, Martin
Weitere Beteiligte (Hrsg. etc.): Norbert T. Müller and Siegfried M. Rump and Klaus Weihrauch and Martin Ziegler

Reliable Computation and Complexity on the Reals (Dagstuhl Seminar 17481)

pdf-format:
dagrep_v007_i011_p142_17481.pdf (2 MB)


Abstract

Naive computations with real numbers on computers may cause serious errors. In traditional numerical computation these errors are often neglected or, more seriously, not identified. Two approaches attack this problem and investigate its background, Reliable Computing and Computable Analysis. Methods in Reliable Computing are essentially mathematical theorems, the assumptions of which are verified on the computer. This verification is performed using the very efficient floating point arithmetic. If the verification succeeds, the assertions are true and correct error bounds have been computed; if not, a corresponding message is given. Thus the results are always mathematically correct. A specific advantage of Reliable Computing is that imprecise data are accepted; the challenge is to develop mathematical theorems the assumptions of which can be verified effectively in floating-point and to produce narrow bounds for the solution. Computable Analysis extends the traditional theory of computability on countable sets to the real numbers and more general spaces by refining continuity to computability. Numerous even basic and simple problems are not computable since they cannot be solved continuously. In many cases computability can be refined to computational complexity which is the time or space a Turing machine needs to compute a result with given precision. By treating precision as a parameter, this goes far beyond the restrictions of double precision arithmetic used in Reliable computing. For practical purposes, however, the asymptotic results from complexity theory must be refined. Software libraries provide efficient implementations for exact real computations. Both approaches are established theories with numerous important results. However, despite of their obvious close relations these two areas are developing almost independently. For exploring possibilities of closer contact we have invited experts from both areas to this seminar. For improving the mutual understanding some tutorial-like talks have been included in the program. As a result of the seminar it can be stated that interesting joint research is possible.

BibTeX - Entry

@Article{mller_et_al:DR:2018:8682,
  author =	{Norbert T. M{\"u}ller and Siegfried M. Rump and Klaus Weihrauch and Martin Ziegler},
  title =	{{ Reliable Computation and Complexity on the Reals (Dagstuhl Seminar 17481)}},
  pages =	{142--167},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2018},
  volume =	{7},
  number =	{11},
  editor =	{Norbert T. M{\"u}ller and Siegfried M. Rump and Klaus Weihrauch and Martin Ziegler},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/8682},
  URN =		{urn:nbn:de:0030-drops-86826},
  doi =		{10.4230/DagRep.7.11.142},
  annote =	{Keywords: Computable Analysis, Verification Methods, Real Complexity Theory, Reliable Computing}
}

Keywords: Computable Analysis, Verification Methods, Real Complexity Theory, Reliable Computing
Seminar: Dagstuhl Reports, Volume 7, Issue 11
Issue Date: 2018
Date of publication: 16.04.2018


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI