default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4th CCA 2007: Siena, Italy
- Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, Ning Zhong:
Proceedings of the Fourth International Conference on Computability and Complexity in Analysis, CCA 2007, Siena, Italy, June 16-18, 2007. Electronic Notes in Theoretical Computer Science 202, Elsevier 2008 - Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, Ning Zhong:
Preface. 1-2 - Hong Lu, Klaus Weihrauch:
Computable Riesz Representation for Locally Compact Hausdorff Spaces. 3-12 - Philippe Moser:
On the Convergence of Fourier Series of Computable Lebesgue Integrable Functions. 13-18 - Marian Alexandru Baroni, Douglas S. Bridges:
Continuity Properties of Preference Relations. 19-25 - Timothy H. McNicholl:
Uniformly Computable Aspects of Inner Functions. 27-36 - Dimiter Skordev
:
e2-computability of e, pi and Other Famous Constants. 37-47 - Daniel Silva Graça, Jorge Buescu, Manuel Lameiras Campagnolo:
Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs. 49-57 - Victor L. Selivanov:
On the Wadge Reducibility of k-Partitions. 59-71 - Stéphane Le Roux, Martin Ziegler:
Singular Coverings and Non-Uniform Notions of Closed Set Computability. 73-88 - Douglas Cenzer, S. Ali Dashti, Jonathan L. F. King:
Effective Symbolic Dynamics. 89-99 - Xishun Zhao, Norbert Th. Müller:
Complexity of Operators on Compact Sets. 101-119 - Ker-I Ko, Fuxiang Yu:
On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane. 121-135 - Volker Bosserhoff:
Notions of Probabilistic Computability on Represented Spaces. 137-170 - José Raymundo Marcial-Romero, M. Andrew Moshier:
Sequential Real Number Computation and Recursive Relations. 171-189 - Gabriel Ciobanu, Danut Rusu:
Supermetrics over Apartness Lattice-Ordered Semigroup. 191-200 - Prashant Batra:
Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra. 201-218 - Dianchen Lu, Qingyan Wang:
Computing the Solution of the m-Korteweg-de Vries Equation on Turing Machines. 219-236 - Tanja Grubba, Klaus Weihrauch, Yatao Xu:
Effectivity on Continuous Functions in Topological Spaces. 237-254 - Xizhong Zheng:
Finitely Bounded Effective Computability. 255-265 - Matthias Schröder:
On the Relationship between Filter Spaces and Weak Limit Spaces. 267-277 - Takakazu Mori, Mariko Yasugi, Yoshiki Tsujii:
Integral of Fine Computable functions and Walsh Fourier series. 279-293 - Jack H. Lutz, Klaus Weihrauch:
Connectivity Properties of Dimension Level Sets. 295-304 - Andrei S. Morozov, Margarita V. Korovina:
Remarks on Sigma-definability without the equality test over the Reals. 305-313 - Robert Rettinger:
On the Computability of Blochs Constant. 315-322 - Satyadev Nandakumar:
A Characterization of Constructive Dimension. 323-337 - Ruth Dillhage:
Computability of the Spectrum of Self-Adjoint Operators and the Computable Operational Calculus. 339-364 - Andrej Bauer, Iztok Kavkler:
Implementing Real Numbers With RZ. 365-384 - Christoph Spandl:
Computability of Topological Pressure for Shifts of Finite Type with Applications in Statistical Physics. 385-401
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 2025-02-02 22:30 CET 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:
