Digital Library
Close Browse articles from a journal
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
                                       All articles of the corresponding issues
 
                             28 results found
no title author magazine year volume issue page(s) type
1 A Characterization of Constructive Dimension Nandakumar, Satyadev
2008
202 C p. 323-337
15 p.
article
2 Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs Graça, Daniel S.
2008
202 C p. 49-57
9 p.
article
3 Complexity of Operators on Compact Sets Zhao, Xishun
2008
202 C p. 101-119
19 p.
article
4 Computability of the Spectrum of Self-Adjoint Operators and the Computable Operational Calculus Dillhage, Ruth
2008
202 C p. 339-364
26 p.
article
5 Computability of Topological Pressure for Shifts of Finite Type with Applications in Statistical Physics Spandl, Christoph
2008
202 C p. 385-401
17 p.
article
6 Computable Riesz Representation for Locally Compact Hausdorff Spaces Lu, Hong
2008
202 C p. 3-12
10 p.
article
7 Computing the Solution of the m-Korteweg-de Vries Equation on Turing Machines Lu, Dianchen
2008
202 C p. 219-236
18 p.
article
8 Connectivity Properties of Dimension Level Sets Lutz, Jack H.
2008
202 C p. 295-304
10 p.
article
9 Continuity Properties of Preference Relations Baroni, Marian
2008
202 C p. 19-25
7 p.
article
10 E 2 -computability of e, π and Other Famous Constants Skordev, Dimiter
2008
202 C p. 37-47
11 p.
article
11 Effective Symbolic Dynamics Cenzer, Douglas
2008
202 C p. 89-99
11 p.
article
12 Effectivity on Continuous Functions in Topological Spaces Grubba, Tanja
2008
202 C p. 237-254
18 p.
article
13 Finitely Bounded Effective Computability Zheng, Xizhong
2008
202 C p. 255-265
11 p.
article
14 Implementing Real Numbers With RZ Bauer, Andrej
2008
202 C p. 365-384
20 p.
article
15 Integral of Fine Computable functions and Walsh Fourier series Mori, Takakazu
2008
202 C p. 279-293
15 p.
article
16 Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra Batra, Prashant
2008
202 C p. 201-218
18 p.
article
17 Notions of Probabilistic Computability on Represented Spaces Bosserhoff, Volker
2008
202 C p. 137-170
34 p.
article
18 On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane Ko, Ker-I
2008
202 C p. 121-135
15 p.
article
19 On the Computability of Blochs Constant Rettinger, Robert
2008
202 C p. 315-322
8 p.
article
20 On the Convergence of Fourier Series of Computable Lebesgue Integrable Functions Moser, Philippe
2008
202 C p. 13-18
6 p.
article
21 On the Relationship between Filter Spaces and Weak Limit Spaces Schröder, Matthias
2008
202 C p. 267-277
11 p.
article
22 On the Wadge Reducibility of k-Partitions Selivanov, Victor
2008
202 C p. 59-71
13 p.
article
23 Preface Dillhage, Ruth
2008
202 C p. 1-2
2 p.
article
24 Remarks on Σ–definability without the equality test over the Reals Morozov, Andrei
2008
202 C p. 305-313
9 p.
article
25 Sequential Real Number Computation and Recursive Relations Marcial-Romero, J. Raymundo
2008
202 C p. 171-189
19 p.
article
26 Singular Coverings and Non-Uniform Notions of Closed Set Computability Le Roux, Stéphane
2008
202 C p. 73-88
16 p.
article
27 Supermetrics over Apartness Lattice-Ordered Semigroup Ciobanu, Gabriel
2008
202 C p. 191-200
10 p.
article
28 Uniformly Computable Aspects of Inner Functions McNicholl, Timothy H.
2008
202 C p. 27-36
10 p.
article
                             28 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands