Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID2nd CCA Conf. 2005: Kyoto, Japan
- Tanja Grubba, Peter Hertling, Hideki Tsuiki, Klaus Weihrauch:
CCA 2005 - Second International Conference on Computability and Complexity in Analysis, August 25-29, 2005, Kyoto, Japan. Informatik Berichte 326-7/2005, FernUniversität Hagen, Germany 2005
Invited Papers
- Daisuke Takahashi:
Low Temperature Limit of Equations - Hidden Discrete Structure. CCA 2005 - Masami Hagiya:
Molecular Computing and Real Number Computing. CCA 2005 - Vasco Brattka:
Some Aspects of Computable Functional Analysis. CCA 2005
Contributed Papers
- Yohji Akama, Shinji Iizuka:
Real Number Representations of Graph-Directed IFS Attractors. CCA 2005: 3-24 - Andrej Bauer, Paul Taylor:
The Dedekind Reals in Abstract Stone Duality. CCA 2005: 25-64 - Douglas S. Bridges, Robin Havea, Peter Schuster:
Ideals in Constructive Banach Algebra Theory. CCA 2005: 65-75 - Douglas S. Bridges, Luminita Vîta:
An Extension Theorem for Ultraweakly Continuous Linear Functionals on B(X, Y). CCA 2005: 77-89 - Douglas S. Bridges, Luminita Vîta:
Proximal Connectedness. CCA 2005: 91-101 - Santiago Figueira, Frank Stephan, Guohua Wu:
Randomness and Universal Machines. CCA 2005: 103-116 - Tanja Grubba, Klaus Weihrauch:
A Computable Version of Dini's Theorem for Topological Spaces. CCA 2005: 117-129 - Peter Hertling:
A Sequentially Computable Function that is not Effectively Continous at any Point. CCA 2005: 131-148 - Hiroyasu Kamo:
Computability and Computable Uniqueness of Urysohn's Universal Metric Space. CCA 2005: 149-159 - Tien D. Kieu:
Mathematical Computability Questions for some Classes of Linear and Non-Linear Differential Equations Originated from Hilbert's Tenth Problem. CCA 2005: 161-168 - Branimir Lambov:
RealLib: an Efficient Implementation of Exact Real Arithmetic. CCA 2005: 169-175 - Takakazu Mori, Yoshiki Tsujii, Mariko Yasugi:
Fine Computable Functions and Effective Fine Convergence. CCA 2005: 177-197 - Robert Rettinger, Xizhong Zheng:
A Hierarchy of Turing Degrees for Divergence Bounded Computable Real Numbers. CCA 2005: 199-209 - Matthias Schröder, Alex K. Simpson:
Representing Probability Measures using Probabilistic Processes. CCA 2005: 211-226 - Paul Taylor:
A Lambda Calculus for Real Analysis. CCA 2005: 227-266 - Klaus Weihrauch:
Multi-Functions on Multi-Represented Sets are Closed under Flowchart Programming. CCA 2005: 267-300 - Mariko Yasugi, Takakazu Mori, Yoshiki Tsujii:
Effective Sequence of Uniformities and its Effective Limit. CCA 2005: 301-318 - Satoru Yoshida:
Generalized Functions with Pseudobounded Support in Constructive Mathematics. CCA 2005: 319-340 - Fuxiang Yu, Arthur W. Chou, Ker-I Ko:
On the Complexity of Finding Circumscribed Rectangles for a Two-Dimensional Domain. CCA 2005: 341-355 - Martin Ziegler:
Effectively Open Real Functions. CCA 2005: 357-374
Satellite Seminars
- Peter Hertling:
Computable Analysis via Representations. CCA 2005: 377 - Takashi Kohno:
Design of Neuromorphic Hardwares. CCA 2005: 377-378 - Atsushi Yoshikawa, Mariko Yasugi:
Computable Versions of Basic Theorems in Functional Analysis. CCA 2005: 378 - Norbert Th. Müller:
Implementing Exact Real Numbers Efficiently. CCA 2005: 378 - Andrej Bauer:
Realizability as Connection between Constructive and Computable Mathematics. CCA 2005: 378-379 - Martín Hötzel Escardó:
Compactness in Topology and Computation. CCA 2005: 379
a service of 
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.
last updated on 2024-04-25 05:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
