Real computations with fake numbers

Felipe Cucker

doi:10.1007/3-540-48523-6_5

Real computations with fake numbers

Felipe Cucker^*

^*Corresponding author for this work

Department of Mathematics

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

6 Citations (Scopus)

Abstract

During the last few years a theory of computation over the real numbers developed with the aim of laying theoretical foundations for the kind of computations performed in numerical analysis. In this paper we describe the notions playing major roles in this theory —with special emphasis on those which do not appear in discrete complexity theory— and review some of its results. © Springer-Verlag Berlin Heidelberg 1999.

Original language	English
Title of host publication	Automata, Languages and Programming
Subtitle of host publication	26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999 Proceedings
Editors	Jirí Wiedermann, Peter Emde Boas, Mogens Nielsen
Place of Publication	Berlin, Heidelberg
Publisher	Springer
Pages	55-73
ISBN (Electronic)	978-3-540-48523-0
ISBN (Print)	9783540662242
DOIs	https://doi.org/10.1007/3-540-48523-6_5
Publication status	Published - 1999
Event	26th International Colloquium on Automata, Languages and Programming (ICALP 1999) - Prague, Czech Republic Duration: 11 Jul 1999 → 15 Jul 1999

Publication series

Name	Lecture Notes in Computer Science
Volume	1644
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	26th International Colloquium on Automata, Languages and Programming (ICALP 1999)
Place	Czech Republic
City	Prague
Period	11/07/99 → 15/07/99

Access Output

10.1007/3-540-48523-6_5

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{95a1bd360e524f54909d414cf057c4c9,

title = "Real computations with fake numbers",

abstract = "During the last few years a theory of computation over the real numbers developed with the aim of laying theoretical foundations for the kind of computations performed in numerical analysis. In this paper we describe the notions playing major roles in this theory —with special emphasis on those which do not appear in discrete complexity theory— and review some of its results. {\textcopyright} Springer-Verlag Berlin Heidelberg 1999.",

author = "Felipe Cucker",

year = "1999",

doi = "10.1007/3-540-48523-6\_5",

language = "English",

isbn = "9783540662242",

series = "Lecture Notes in Computer Science",

publisher = "Springer ",

pages = "55--73",

editor = "Wiedermann, \{Jir{\'i} \} and Boas, \{Peter Emde \} and Nielsen, \{Mogens \}",

booktitle = "Automata, Languages and Programming",

note = "26th International Colloquium on Automata, Languages and Programming (ICALP 1999) ; Conference date: 11-07-1999 Through 15-07-1999",

}

Cucker, F 1999, Real computations with fake numbers. in J Wiedermann, PE Boas & M Nielsen (eds), Automata, Languages and Programming: 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999 Proceedings. Lecture Notes in Computer Science, vol. 1644, Springer , Berlin, Heidelberg, pp. 55-73, 26th International Colloquium on Automata, Languages and Programming (ICALP 1999), Prague, Czech Republic, 11/07/99. https://doi.org/10.1007/3-540-48523-6_5

Real computations with fake numbers. / Cucker, Felipe.
Automata, Languages and Programming: 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999 Proceedings. ed. / Jirí Wiedermann; Peter Emde Boas; Mogens Nielsen. Berlin, Heidelberg: Springer , 1999. p. 55-73 (Lecture Notes in Computer Science; Vol. 1644).

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

T1 - Real computations with fake numbers

AU - Cucker, Felipe

PY - 1999

Y1 - 1999

N2 - During the last few years a theory of computation over the real numbers developed with the aim of laying theoretical foundations for the kind of computations performed in numerical analysis. In this paper we describe the notions playing major roles in this theory —with special emphasis on those which do not appear in discrete complexity theory— and review some of its results. © Springer-Verlag Berlin Heidelberg 1999.

AB - During the last few years a theory of computation over the real numbers developed with the aim of laying theoretical foundations for the kind of computations performed in numerical analysis. In this paper we describe the notions playing major roles in this theory —with special emphasis on those which do not appear in discrete complexity theory— and review some of its results. © Springer-Verlag Berlin Heidelberg 1999.

UR - https://www.scopus.com/pages/publications/22644449122

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-22644449122&origin=recordpage

U2 - 10.1007/3-540-48523-6_5

DO - 10.1007/3-540-48523-6_5

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 9783540662242

T3 - Lecture Notes in Computer Science

SP - 55

EP - 73

BT - Automata, Languages and Programming

A2 - Wiedermann, Jirí

A2 - Boas, Peter Emde

A2 - Nielsen, Mogens

PB - Springer

CY - Berlin, Heidelberg

T2 - 26th International Colloquium on Automata, Languages and Programming (ICALP 1999)

Y2 - 11 July 1999 through 15 July 1999

ER -

Real computations with fake numbers

Abstract

Publication series

Conference

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this