6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@Proceedings{bauer_et_al:OASIcs.CCA.2009, title = {{OASIcs, Volume 11, CCA'09, Complete Volume}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2012}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009}, URN = {urn:nbn:de:0030-drops-35738}, doi = {10.4230/OASIcs.CCA.2009}, annote = {Keywords: Mathematics of Computing, Analysis of Algorithms and Problem Complexity} }
6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. i-ii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{bauer_et_al:OASIcs.CCA.2009.2248, author = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, title = {{CCA 2009 Front Matter - Proceedings of the Sixth International Conference on Computability and Complexity in Analysis}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {i--ii}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2248}, URN = {urn:nbn:de:0030-drops-22486}, doi = {10.4230/OASIcs.CCA.2009.2248}, annote = {Keywords: Computable analysis, computability, complexity, Turing machine, constructive mathematics, real number computation, computer arithmetic, exact real ari} }
Andrej Bauer, Peter Hertling, and Ker-I Ko. CCA 2009 Preface - Proceedings of the Sixth International Conference on Computability and Complexity in Analysis. In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, p. 1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{bauer_et_al:OASIcs.CCA.2009.2249, author = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, title = {{CCA 2009 Preface - Proceedings of the Sixth International Conference on Computability and Complexity in Analysis}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {1--1}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2249}, URN = {urn:nbn:de:0030-drops-22492}, doi = {10.4230/OASIcs.CCA.2009.2249}, annote = {Keywords: Computable analysis, computability, complexity, Turing machine, constructive mathematics, real number computation, computer arithmetic, exact real ari} }
Mark Braverman. Computability and Complexity of Julia Sets (Invited Talk). In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, p. 3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{braverman:OASIcs.CCA.2009.2250, author = {Braverman, Mark}, title = {{Computability and Complexity of Julia Sets}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {3--3}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2250}, URN = {urn:nbn:de:0030-drops-22508}, doi = {10.4230/OASIcs.CCA.2009.2250}, annote = {Keywords: Computability, computable analysis, dynamical systems, complex dynamics, Julia sets Computability, computable analysis, dynamical systems, complex dynamics, Julia sets} }
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). In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. 5-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{kreinovich:OASIcs.CCA.2009.2251, author = {Kreinovich, Vladik}, title = {{From Interval Computations to Constraint-Related Set Computations: Towards Faster Estimation of Statistics and ODEs under Interval and p-Box Uncertainty}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {5--16}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2251}, URN = {urn:nbn:de:0030-drops-22516}, doi = {10.4230/OASIcs.CCA.2009.2251}, annote = {Keywords: Interval computations, set computations, probability boxes, uncertainty, efficient algorithms} }
Dana Scott. Semilattices, Domains, and Computability (Invited Talk). In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, p. 17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{scott:OASIcs.CCA.2009.2252, author = {Scott, Dana}, title = {{Semilattices, Domains, and Computability}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {17--17}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2252}, URN = {urn:nbn:de:0030-drops-22525}, doi = {10.4230/OASIcs.CCA.2009.2252}, annote = {Keywords: Semilattices, domains, computability} }
Ning Zhong. Computable Analysis of Differential Equations (Invited Talk). In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, p. 19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{zhong:OASIcs.CCA.2009.2253, author = {Zhong, Ning}, title = {{Computable Analysis of Differential Equations}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {19--19}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2253}, URN = {urn:nbn:de:0030-drops-22535}, doi = {10.4230/OASIcs.CCA.2009.2253}, annote = {Keywords: Computable analysis, differential equations} }
Martin Escardó. Theory and Practice of Higher-type Computation (Tutorial). In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, p. 21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{escardo:OASIcs.CCA.2009.2254, author = {Escard\'{o}, Martin}, title = {{Theory and Practice of Higher-type Computation}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {21--21}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2254}, URN = {urn:nbn:de:0030-drops-22540}, doi = {10.4230/OASIcs.CCA.2009.2254}, annote = {Keywords: Higher-type computation, domain theory, Kleene-Kreisel spaces, Ershov-Scott domains, QCB spaces, equilogical spaces, PCF} }
Bas Spitters and Russell O'Connor. Computer Verified Exact Analysis (Tutorial). In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, p. 23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{spitters_et_al:OASIcs.CCA.2009.2255, author = {Spitters, Bas and O'Connor, Russell}, title = {{Computer Verified Exact Analysis}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {23--23}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2255}, URN = {urn:nbn:de:0030-drops-22554}, doi = {10.4230/OASIcs.CCA.2009.2255}, annote = {Keywords: Proof assistant, dependent type theory, constructive analysis} }
Valentin V. Andreev and Timothy H. McNicholl. Computing Conformal Maps onto Canonical Slit Domains. In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. 25-36, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{andreev_et_al:OASIcs.CCA.2009.2256, author = {Andreev, Valentin V. and McNicholl, Timothy H.}, title = {{Computing Conformal Maps onto Canonical Slit Domains}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {25--36}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2256}, URN = {urn:nbn:de:0030-drops-22561}, doi = {10.4230/OASIcs.CCA.2009.2256}, annote = {Keywords: Computable analysis, conformal mapping} }
Andrej Bauer and Jens Blanck. Canonical Effective Subalgebras of Classical Algebras as Constructive Metric Completions. In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. 37-48, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{bauer_et_al:OASIcs.CCA.2009.2257, author = {Bauer, Andrej and Blanck, Jens}, title = {{Canonical Effective Subalgebras of Classical Algebras as Constructive Metric Completions}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {37--48}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2257}, URN = {urn:nbn:de:0030-drops-22579}, doi = {10.4230/OASIcs.CCA.2009.2257}, annote = {Keywords: Effective algebras, realizability, constructive metric spaces} }
Ulrich Berger. Realisability and Adequacy for (Co)induction. In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. 49-60, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{berger:OASIcs.CCA.2009.2258, author = {Berger, Ulrich}, title = {{Realisability and Adequacy for (Co)induction}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {49--60}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2258}, URN = {urn:nbn:de:0030-drops-22581}, doi = {10.4230/OASIcs.CCA.2009.2258}, annote = {Keywords: Constructive Analysis, realisability, program extraction, semantics} }
Josef Berger and Douglas Bridges. A Constructive Study of Landau's Summability Theorem. In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. 61-70, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{berger_et_al:OASIcs.CCA.2009.2259, author = {Berger, Josef and Bridges, Douglas}, title = {{A Constructive Study of Landau's Summability Theorem}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {61--70}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2259}, URN = {urn:nbn:de:0030-drops-22595}, doi = {10.4230/OASIcs.CCA.2009.2259}, annote = {Keywords: Constructive analysis, Landau's theorem, uniform boundedness theorem Constructive analysis, Landau's theorem, uniform boundedness theorem} }
Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, and Wolfgang Merkle. Separations of Non-monotonic Randomness Notions. In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. 71-82, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{bienvenu_et_al:OASIcs.CCA.2009.2260, author = {Bienvenu, Laurent and H\"{o}lzl, Rupert and Kr\"{a}ling, Thorsten and Merkle, Wolfgang}, title = {{Separations of Non-monotonic Randomness Notions}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {71--82}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2260}, URN = {urn:nbn:de:0030-drops-22601}, doi = {10.4230/OASIcs.CCA.2009.2260}, annote = {Keywords: Martin-L\"{o}f randomness, Kolmogorov-Loveland randomness, Kolmogorov complexity, martingales, betting strategies} }
Vasco Brattka and Guido Gherardi. Weihrauch Degrees, Omniscience Principles and Weak Computability. In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. 83-94, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{brattka_et_al:OASIcs.CCA.2009.2261, author = {Brattka, Vasco and Gherardi, Guido}, title = {{Weihrauch Degrees, Omniscience Principles and Weak Computability}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {83--94}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2261}, URN = {urn:nbn:de:0030-drops-22617}, doi = {10.4230/OASIcs.CCA.2009.2261}, annote = {Keywords: Computable analysis, constructive analysis, reverse mathematics, effective descriptive set theory} }
Vasco Brattka and Guido Gherardi. Effective Choice and Boundedness Principles in Computable Analysis. In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. 95-106, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{brattka_et_al:OASIcs.CCA.2009.2262, author = {Brattka, Vasco and Gherardi, Guido}, title = {{Effective Choice and Boundedness Principles in Computable Analysis}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {95--106}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2262}, URN = {urn:nbn:de:0030-drops-22629}, doi = {10.4230/OASIcs.CCA.2009.2262}, annote = {Keywords: Computable analysis, constructive analysis, reverse mathematics, effective descriptive set theory} }
Pieter Collins. Computability of Homology for Compact Absolute Neighbourhood Retracts. In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. 107-118, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{collins:OASIcs.CCA.2009.2263, author = {Collins, Pieter}, title = {{Computability of Homology for Compact Absolute Neighbourhood Retracts}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {107--118}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2263}, URN = {urn:nbn:de:0030-drops-22635}, doi = {10.4230/OASIcs.CCA.2009.2263}, annote = {Keywords: Computability, homology, compact absolute neighbourhood retract} }
Matthew de Brecht and Akihiro Yamamoto. Sigma^0_alpha - Admissible Representations (Extended Abstract). In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. 119-130, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{debrecht_et_al:OASIcs.CCA.2009.2264, author = {de Brecht, Matthew and Yamamoto, Akihiro}, title = {{Sigma^0\underlinealpha - Admissible Representations}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {119--130}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2264}, URN = {urn:nbn:de:0030-drops-22649}, doi = {10.4230/OASIcs.CCA.2009.2264}, annote = {Keywords: Admissible representations, Borel measurable functions, computable analysis, descriptive set theory} }
Hannes Diener and Peter Schuster. Uniqueness, Continuity, and Existence of Implicit Functions in Constructive Analysis. In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. 131-140, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{diener_et_al:OASIcs.CCA.2009.2265, author = {Diener, Hannes and Schuster, Peter}, title = {{Uniqueness, Continuity, and Existence of Implicit Functions in Constructive Analysis}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {131--140}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2265}, URN = {urn:nbn:de:0030-drops-22651}, doi = {10.4230/OASIcs.CCA.2009.2265}, annote = {Keywords: Implicit function, uniqueness, continuity, constructive analysis, countable choice} }
Christine Gaßner. Relativizations of the P =? DNP Question for the BSS Model. In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. 141-148, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{ganer:OASIcs.CCA.2009.2266, author = {Ga{\ss}ner, Christine}, title = {{Relativizations of the P =? DNP Question for the BSS Model}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {141--148}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2266}, URN = {urn:nbn:de:0030-drops-22667}, doi = {10.4230/OASIcs.CCA.2009.2266}, annote = {Keywords: BSS machines, oracle machines, relativizations, P-DNP problem, real knapsack problem} }
Xiaoyang Gu, Jack H. Lutz, and Elvira Mayordomo. Curves That Must Be Retraced. In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. 149-160, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{gu_et_al:OASIcs.CCA.2009.2267, author = {Gu, Xiaoyang and Lutz, Jack H. and Mayordomo, Elvira}, title = {{Curves That Must Be Retraced}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {149--160}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2267}, URN = {urn:nbn:de:0030-drops-22674}, doi = {10.4230/OASIcs.CCA.2009.2267}, annote = {Keywords: Computable analysis, computable curve, computational complexity, Hausdorff measure, rectifiable curve} }
Zvonko Iljazovic. Effective Dispersion in Computable Metric Spaces. In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. 161-172, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{iljazovic:OASIcs.CCA.2009.2268, author = {Iljazovic, Zvonko}, title = {{Effective Dispersion in Computable Metric Spaces}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {161--172}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2268}, URN = {urn:nbn:de:0030-drops-22685}, doi = {10.4230/OASIcs.CCA.2009.2268}, annote = {Keywords: Computable metric space, effective separating sequence, computability structure, effectively totally bounded computable metric space, effectively disp} }
Jöran Mielke and Ludwig Staiger. On Oscillation-free epsilon-random Sequences II. In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. 173-184, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{mielke_et_al:OASIcs.CCA.2009.2269, author = {Mielke, J\"{o}ran and Staiger, Ludwig}, title = {{On Oscillation-free epsilon-random Sequences II}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {173--184}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2269}, URN = {urn:nbn:de:0030-drops-22698}, doi = {10.4230/OASIcs.CCA.2009.2269}, annote = {Keywords: Omega-words, partial randomness, a priori complexity, monotone complexity} }
Takakazu Mori, Yoshiki Tsujii, and Mariko Yasugi. Computability of Probability Distributions and Distribution Functions. In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. 185-196, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{mori_et_al:OASIcs.CCA.2009.2270, author = {Mori, Takakazu and Tsujii, Yoshiki and Yasugi, Mariko}, title = {{Computability of Probability Distributions and Distribution Functions}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {185--196}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2270}, URN = {urn:nbn:de:0030-drops-22704}, doi = {10.4230/OASIcs.CCA.2009.2270}, annote = {Keywords: Computable probability distribution, computable probability distribution function, effective convergence of probability distributions} }
Arno Pauly. How Discontinuous is Computing Nash Equilibria? (Extended Abstract). In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. 197-208, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{pauly:OASIcs.CCA.2009.2271, author = {Pauly, Arno}, title = {{How Discontinuous is Computing Nash Equilibria?}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {197--208}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2271}, URN = {urn:nbn:de:0030-drops-22719}, doi = {10.4230/OASIcs.CCA.2009.2271}, annote = {Keywords: Game Theory, computable analysis, Nash equilibrium, discontinuity} }
Robert Rettinger. Towards the Complexity of Riemann Mappings (Extended Abstract). In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. 209-220, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{rettinger:OASIcs.CCA.2009.2272, author = {Rettinger, Robert}, title = {{Towards the Complexity of Riemann Mappings}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {209--220}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2272}, URN = {urn:nbn:de:0030-drops-22724}, doi = {10.4230/OASIcs.CCA.2009.2272}, annote = {Keywords: Riemann mapping, complexity, polynomial time} }
Robert Rettinger and Xizhong Zheng. On the Computability of Rectifiable Simple Curve (Extended Abstract). In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. 221-232, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{rettinger_et_al:OASIcs.CCA.2009.2273, author = {Rettinger, Robert and Zheng, Xizhong}, title = {{On the Computability of Rectifiable Simple Curve}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {221--232}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2273}, URN = {urn:nbn:de:0030-drops-22736}, doi = {10.4230/OASIcs.CCA.2009.2273}, annote = {Keywords: Computable curve, simple curve, rectifiable curve, point separability} }
Matthias Schröder. A Note on Closed Subsets in Quasi-zero-dimensional Qcb-spaces (Extended Abstract). In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. 233-244, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{schroder:OASIcs.CCA.2009.2274, author = {Schr\"{o}der, Matthias}, title = {{A Note on Closed Subsets in Quasi-zero-dimensional Qcb-spaces}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {233--244}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2274}, URN = {urn:nbn:de:0030-drops-22748}, doi = {10.4230/OASIcs.CCA.2009.2274}, annote = {Keywords: Computable analysis, Qcb-spaces, extendability} }
Yoshiki Tsujii, Takakazu Mori, Mariko Yasugi, and Hideki Tsuiki. Random Iteration Algorithm for Graph-Directed Sets. In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. 245-256, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{tsujii_et_al:OASIcs.CCA.2009.2275, author = {Tsujii, Yoshiki and Mori, Takakazu and Yasugi, Mariko and Tsuiki, Hideki}, title = {{Random Iteration Algorithm for Graph-Directed Sets}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {245--256}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2275}, URN = {urn:nbn:de:0030-drops-22759}, doi = {10.4230/OASIcs.CCA.2009.2275}, annote = {Keywords: Random iteration algorithms, graph-directed sets, displaying fractals, invariant probability measures} }
Klaus Weihrauch. Computable Separation in Topology, from T_0 to T_3. In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. 257-268, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{weihrauch:OASIcs.CCA.2009.2276, author = {Weihrauch, Klaus}, title = {{Computable Separation in Topology, from T\underline0 to T\underline3}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {257--268}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2276}, URN = {urn:nbn:de:0030-drops-22764}, doi = {10.4230/OASIcs.CCA.2009.2276}, annote = {Keywords: Computable topology, computable separation} }
Martin Ziegler. Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability. In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. 269-280, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{ziegler:OASIcs.CCA.2009.2277, author = {Ziegler, Martin}, title = {{Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {269--280}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2277}, URN = {urn:nbn:de:0030-drops-22770}, doi = {10.4230/OASIcs.CCA.2009.2277}, annote = {Keywords: Nonuniform computability, recursive analysis, topological complexity, linear algebra} }
Feedback for Dagstuhl Publishing