![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
6th CCA Conf. 2009: Ljubljana, Slovenia
- Andrej Bauer, Peter Hertling, Ker-I Ko:
Sixth International Conference on Computability and Complexity in Analysis, CCA 2009, August 18-22, 2009, Ljubljana, Slovenia. OASIcs 11, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany 2009 - Andrej Bauer, Peter Hertling, Ker-I Ko:
CCA 2009 Front Matter - Proceedings of the Sixth International Conference on Computability and Complexity in Analysis. - Andrej Bauer, Peter Hertling, Ker-I Ko:
CCA 2009 Preface - Proceedings of the Sixth International Conference on Computability and Complexity in Analysis. - Mark Braverman:
Computability and Complexity of Julia Sets (Invited Talk). - Vladik Kreinovich:
From Interval Computations to Constraint-Related Set Computations: Towards Faster Estimation of Statistics and ODEs under Interval and p-Box Uncertainty (Invited Talk). - Dana S. Scott:
Semilattices, Domains, and Computability (Invited Talk). - Ning Zhong:
Computable Analysis of Differential Equations (Invited Talk). - Martín Hötzel Escardó:
Theory and Practice of Higher-type Computation (Tutorial). - Bas Spitters, Russell O'Connor:
Computer Verified Exact Analysis (Tutorial). - Valentin V. Andreev, Timothy H. McNicholl:
Computing Conformal Maps onto Canonical Slit Domains. - Andrej Bauer, Jens Blanck:
Canonical Effective Subalgebras of Classical Algebras as Constructive Metric Completions. - Ulrich Berger:
Realisability and Adequacy for (Co)induction. - Josef Berger, Douglas S. Bridges:
A Constructive Study of Landau's Summability Theorem. - Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle:
Separations of Non-monotonic Randomness Notions. - Vasco Brattka, Guido Gherardi:
Weihrauch Degrees, Omniscience Principles and Weak Computability. - Vasco Brattka, Guido Gherardi:
Effective Choice and Boundedness Principles in Computable Analysis. - Pieter Collins:
Computability of Homology for Compact Absolute Neighbourhood Retracts. - Matthew de Brecht, Akihiro Yamamoto:
Sigma^0_alpha - Admissible Representations (Extended Abstract). - Hannes Diener, Peter Schuster:
Uniqueness, Continuity, and Existence of Implicit Functions in Constructive Analysis. - Christine Gaßner:
Relativizations of the P =? DNP Question for the BSS Model. - Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo:
Curves That Must Be Retraced. - Zvonko Iljazovic:
Effective Dispersion in Computable Metric Spaces. - Jöran Mielke, Ludwig Staiger
:
On Oscillation-free epsilon-random Sequences II. - Takakazu Mori, Yoshiki Tsujii, Mariko Yasugi:
Computability of Probability Distributions and Distribution Functions. - Arno Pauly:
How Discontinuous is Computing Nash Equilibria? (Extended Abstract). - Robert Rettinger:
Towards the Complexity of Riemann Mappings (Extended Abstract). - Robert Rettinger, Xizhong Zheng:
On the Computability of Rectifiable Simple Curve (Extended Abstract). - Matthias Schröder:
A Note on Closed Subsets in Quasi-zero-dimensional Qcb-spaces (Extended Abstract). - Yoshiki Tsujii, Takakazu Mori, Mariko Yasugi, Hideki Tsuiki:
Random Iteration Algorithm for Graph-Directed Sets. - Klaus Weihrauch:
Computable Separation in Topology, from T_0 to T_3. - Martin Ziegler:
Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability.
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.