Computability and complexity in analysis : 4th international workshop, CCA 2000, Swansea, UK, September 17-19, 2000 : selected papers
The workshop on Computability and Complexity in Analysis, CCA 2000, was hosted by the Department of Computer Science of the University of Wales Swansea, September 17{19, 2000. It was the fourth workshop in a successful series of workshops: CCA 95 in Hagen, Germany, CCA 96 in Trier, Germany, and CCA...
Shranjeno v:
| Korporativna značnica: | |
|---|---|
| Drugi avtorji: | , , |
| Format: | Livre numérique |
| Jezik: | Anglais |
| Izdano: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serija: | Lecture notes in computer science
2064 |
| Teme: | |
| Online dostop: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Sporočilo: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Computability and complexity in analysis, 4th international workshop, CCA 2000, Swansea, UK, September 17-19, 2000, selected papers, Jens Blanck, Vasco Brattka, Peter Hertling (eds.), 2001, New York, Springer, 1 vol. (VIII-393 p.), Lecture notes in computer science, 3-540-42197-1 • Computability and Complexity in Analysis, Texte imprimé, 9783662193310 |
Kazalo:
- Computability and Complexity in Analysis
- Effectivity of Regular Spaces
- The Degree of Unsolvability of a Real Number
- A Survey of Exact Arithmetic Implementations
- Standard Representations of Effective Metric Spaces
- Banach-Mazur Computable Functions on Metric Spaces
- A Generic Root Operation for Exact Real Arithmetic
- Effective Contraction Theorem and Its Application
- Polynomially Time Computable Functions over p-Adic Fields
- On the Computational Content of the Krasnoselski and Ishikawa Fixed Point Theorems
- Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory
- Computing a Required Absolute Precision from a Stream of Linear Fractional Transformations
- ?-Approximable Functions
- Computabilities of Fine-Continuous Functions
- The iRRAM: Exact Arithmetic in C++
- The Uniformity Conjecture
- Admissible Representations of Limit Spaces
- Characterization of the Computable Real Numbers by Means of Primitive Recursive Functions
- Effective Fixed Point Theorem over a Non-Computably Separable Metric Space
- Computational Dimension of Topological Spaces
- Some Properties of the Effective Uniform Topological Space
- On Computable Metric Spaces Tietze-Urysohn Extension Is Computable
- Is the Linear Schrödinger Propagator Turing Computable?
- A Computable Spectral Theorem
- Report on Competition
- Exact Real Arithmetic Systems: Results of Competition.