Name
Abstract | ||
|---|---|---|
The purpose of this paper is to survey our recent research in computability and definability over continuous data types such as the real numbers, real-valued functions and functionals. We investigate the expressive power and algorithmic properties of the language of formulas intended to represent computability on continuous data types. In the case of the real numbers we illustrate how computability can be expressed in the language of Sigma-formulas. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1007/978-3-540-39866-0_25 | Lecture Notes in Computer Science |
DocType | Volume | ISSN |
Conference | 2890 | 0302-9743 |
Citations | PageRank | References |
0 | 0.34 | 14 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Margarita V. Korovina | 1 | 84 | 15.61 |