2. CCA Conf. 2005: Kyoto, Japan
Tanja Grubba, Peter Hertling, Hideki Tsuiki, Klaus Weihrauch (Eds.): CCA 2005 - Second International Conference on Computability and Complexity in Analysis, August 25-29, 2005, Kyoto, Japan. FernUniversität Hagen, Germany 2005 Informatik Berichte
Invited Papers
- Daisuke Takahashi: Low Temperature Limit of Equations - Hidden Discrete Structure.
- Masami Hagiya: Molecular Computing and Real Number Computing.
- Vasco Brattka: Some Aspects of Computable Functional Analysis.
Contributed Papers
- Douglas S. Bridges, Robin Havea, Peter Schuster: Ideals in Constructive Banach Algebra Theory. 65-75
- Douglas S. Bridges, Luminita Vîta: An Extension Theorem for Ultraweakly Continuous Linear Functionals on B(X, Y). 77-89
- Tanja Grubba, Klaus Weihrauch: A Computable Version of Dini's Theorem for Topological Spaces. 117-129
- Peter Hertling: A Sequentially Computable Function that is not Effectively Continous at any Point. 131-148
- Hiroyasu Kamo: Computability and Computable Uniqueness of Urysohn's Universal Metric Space. 149-159
- Tien D. Kieu: Mathematical Computability Questions for some Classes of Linear and Non-Linear Differential Equations Originated from Hilbert's Tenth Problem. 161-168
- Branimir Lambov: RealLib: an Efficient Implementation of Exact Real Arithmetic. 169-175
- Takakazu Mori, Yoshiki Tsujii, Mariko Yasugi: Fine Computable Functions and Effective Fine Convergence. 177-197
- Robert Rettinger, Xizhong Zheng: A Hierarchy of Turing Degrees for Divergence Bounded Computable Real Numbers. 199-209
- Matthias Schröder, Alex K. Simpson: Representing Probability Measures using Probabilistic Processes. 211-226
- Paul Taylor: A Lambda Calculus for Real Analysis. 227-266
- Klaus Weihrauch: Multi-Functions on Multi-Represented Sets are Closed under Flowchart Programming. 267-300
- Mariko Yasugi, Takakazu Mori, Yoshiki Tsujii: Effective Sequence of Uniformities and its Effective Limit. 301-318
- Satoru Yoshida: Generalized Functions with Pseudobounded Support in Constructive Mathematics. 319-340
- Fuxiang Yu, Arthur W. Chou, Ker-I Ko: On the Complexity of Finding Circumscribed Rectangles for a Two-Dimensional Domain. 341-355
- Martin Ziegler: Effectively Open Real Functions. 357-374
Satellite Seminars
- Peter Hertling: Computable Analysis via Representations. 377
- Takashi Kohno: Design of Neuromorphic Hardwares. 377-378
- Norbert Th. Müller: Implementing Exact Real Numbers Efficiently. 378
- Andrej Bauer: Realizability as Connection between Constructive and Computable Mathematics. 378-379
- Martín Hötzel Escardó: Compactness in Topology and Computation. 379
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T214307 by the dblp team