Computability and Complexity in Analysis - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

24

(FIVE YEARS 0)

H-INDEX

5

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540421979, 9783540453352

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A Computable Spectral Theorem

Computability and Complexity in Analysis - Lecture Notes in Computer Science ◽

10.1007/3-540-45335-0_23 ◽

2001 ◽

pp. 378-388 ◽

Author(s):

Martin Ziegler ◽

Vasco Brattka

Keyword(s):

Spectral Theorem

Download Full-text

Some Properties of the Effective Uniform Topological Space

Computability and Complexity in Analysis - Lecture Notes in Computer Science ◽

10.1007/3-540-45335-0_20 ◽

2001 ◽

pp. 336-356 ◽

Author(s):

Yoshiki Tsujii ◽

Mariko Yasugi ◽

Takakazu Mori

Keyword(s):

Topological Space

Download Full-text

Effective Fixed Point Theorem over a Non-Computably Separable Metric Space

Computability and Complexity in Analysis - Lecture Notes in Computer Science ◽

10.1007/3-540-45335-0_18 ◽

2001 ◽

pp. 310-322

Author(s):

Izumi Takeuti

Keyword(s):

Fixed Point ◽

Fixed Point Theorem ◽

Point Theorem ◽

Metric Space ◽

Separable Metric Space

Download Full-text

Computabilities of Fine-Continuous Functions

Computability and Complexity in Analysis - Lecture Notes in Computer Science ◽

10.1007/3-540-45335-0_13 ◽

2001 ◽

pp. 200-221 ◽

Author(s):

Takakazu Mori

Keyword(s):

Continuous Functions

Download Full-text

Exact Real Arithmetic Systems: Results of Competition

Computability and Complexity in Analysis - Lecture Notes in Computer Science ◽

10.1007/3-540-45335-0_24 ◽

2001 ◽

pp. 389-393 ◽

Author(s):

Jens Blanck

Download Full-text

Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory

Computability and Complexity in Analysis - Lecture Notes in Computer Science ◽

10.1007/3-540-45335-0_10 ◽

2001 ◽

pp. 146-168 ◽

Author(s):

Margarita V. Korovina ◽

Oleg V. Kudinov

Keyword(s):

Download Full-text

On Computable Metric Spaces Tietze-Urysohn Extension Is Computable

Computability and Complexity in Analysis - Lecture Notes in Computer Science ◽

10.1007/3-540-45335-0_21 ◽

2001 ◽

pp. 357-368 ◽

Author(s):

Klaus Weihrauch

Keyword(s):

Download Full-text

Banach-Mazur Computable Functions on Metric Spaces

Computability and Complexity in Analysis - Lecture Notes in Computer Science ◽

10.1007/3-540-45335-0_5 ◽

2001 ◽

pp. 69-81 ◽

Author(s):

Peter Hertling

Keyword(s):

Metric Spaces ◽

Computable Functions

Download Full-text

On the Computational Content of the Krasnoselski and Ishikawa Fixed Point Theorems

Computability and Complexity in Analysis - Lecture Notes in Computer Science ◽

10.1007/3-540-45335-0_9 ◽

2001 ◽

pp. 119-145 ◽

Author(s):

Ulrich Kohlenbach

Keyword(s):

Fixed Point ◽

Fixed Point Theorems

Download Full-text

Effective Contraction Theorem and Its Application

Computability and Complexity in Analysis - Lecture Notes in Computer Science ◽

10.1007/3-540-45335-0_7 ◽

2001 ◽

pp. 88-100 ◽

Author(s):

Hiroyasu Kamo

Keyword(s):

Contraction Theorem

Download Full-text