Results 1  10
of
20
Analyzing Proofs in Analysis
 LOGIC: FROM FOUNDATIONS TO APPLICATIONS. EUROPEAN LOGIC COLLOQUIUM (KEELE
, 1993
"... ..."
Recursively Enumerable Reals and Chaitin Ω Numbers
"... A real is called recursively enumerable if it is the limit of a recursive, increasing, converging sequence of rationals. Following Solovay [23] and Chaitin [10] we say that an r.e. real dominates an r.e. real if from a good approximation of from below one can compute a good approximation of from b ..."
Abstract

Cited by 34 (3 self)
 Add to MetaCart
A real is called recursively enumerable if it is the limit of a recursive, increasing, converging sequence of rationals. Following Solovay [23] and Chaitin [10] we say that an r.e. real dominates an r.e. real if from a good approximation of from below one can compute a good approximation of from below. We shall study this relation and characterize it in terms of relations between r.e. sets. Solovay's [23]like numbers are the maximal r.e. real numbers with respect to this order. They are random r.e. real numbers. The halting probability ofa universal selfdelimiting Turing machine (Chaitin's Ω number, [9]) is also a random r.e. real. Solovay showed that any Chaitin Ω number islike. In this paper we show that the converse implication is true as well: any Ωlike real in the unit interval is the halting probability of a universal selfdelimiting Turing machine.
Mathematically Strong Subsystems of Analysis With Low Rate of Growth of Provably Recursive Functionals
, 1995
"... This paper is the first one in a sequel of papers resulting from the authors Habilitationsschrift [22] which are devoted to determine the growth in proofs of standard parts of analysis. A hierarchy (GnA # )n#I N of systems of arithmetic in all finite types is introduced whose definable objects of ..."
Abstract

Cited by 34 (21 self)
 Add to MetaCart
This paper is the first one in a sequel of papers resulting from the authors Habilitationsschrift [22] which are devoted to determine the growth in proofs of standard parts of analysis. A hierarchy (GnA # )n#I N of systems of arithmetic in all finite types is introduced whose definable objects of type 1 = 0(0) correspond to the Grzegorczyk hierarchy of primitive recursive functions. We establish the following extraction rule for an extension of GnA # by quantifierfree choice ACqf and analytical axioms # having the form #x # #y ## sx#z # F0 (including also a `non standard' axiom F  which does not hold in the full settheoretic model but in the strongly majorizable functionals): From a proof GnA # +ACqf + # # #u 1 , k 0 #v ## tuk#w 0 A0(u, k, v, w) one can extract a uniform bound # such that #u 1 , k 0 #v ## tuk#w # #ukA0 (u, k, v, w) holds in the full settheoretic type structure. In case n = 2 (resp. n = 3) #uk is a polynomial (resp. an elementary recursive function) in k, u M := #x. max(u0, . . . , ux). In the present paper we show that for n # 2, GnA # +ACqf+F  proves a generalization of the binary Knig's lemma yielding new conservation results since the conclusion of the above rule can be verified in G max(3,n) A # in this case. In a subsequent paper we will show that many important ine#ective analytical principles and theorems can be proved already in G2A # +ACqf+# for suitable #. 1
Randomness Space
 Automata, Languages and Programming, Proceedings of the 25th International Colloquium, ICALP’98
, 1998
"... MartinL#of de#ned in#nite random sequences over a #nite alphabet via randomness tests which describe sets having measure zero in a constructive sense. In this paper this concept is generalized to separable topological spaces with a measure, following a suggestion of Zvonkin and Levin. After stud ..."
Abstract

Cited by 21 (4 self)
 Add to MetaCart
MartinL#of de#ned in#nite random sequences over a #nite alphabet via randomness tests which describe sets having measure zero in a constructive sense. In this paper this concept is generalized to separable topological spaces with a measure, following a suggestion of Zvonkin and Levin. After studying basic results and constructions for such randomness spaces a general invariance result is proved which gives conditions under which a function between randomness spaces preserves randomness. This corrects and extends a result bySchnorr. Calude and J#urgensen proved that the randomness notion for real numbers obtained by considering their bary representations is independent from the base b. We use our invariance result to show that this notion is identical with the notion which one obtains by viewing the real number space directly as a randomness space. Furthermore, arithmetic properties of random real numbers are derived, for example that every computable analytic function pres...
New Effective Moduli of Uniqueness and Uniform aPriori Estimates for Constants of Strong Unicity by Logical Analysis of Known Proofs in Best Approximation Theory
, 1993
"... Let U and V be complete separable metric spaces, Vu compact in V and G : U IR a continuous function. For a large class of (usually nonconstructive) proofs of uniqueness theorems Vu G(u, v1 ) = inf G(u, v) = G(u, v2) v1 = v2 one can extract an e#ective modulus of uniqueness # by ..."
Abstract

Cited by 16 (12 self)
 Add to MetaCart
Let U and V be complete separable metric spaces, Vu compact in V and G : U IR a continuous function. For a large class of (usually nonconstructive) proofs of uniqueness theorems Vu G(u, v1 ) = inf G(u, v) = G(u, v2) v1 = v2 one can extract an e#ective modulus of uniqueness # by logical analysis, i.e.
The Effective Riemann Mapping Theorem
, 1997
"... The main results of the paper are two effective versions of the Riemann mapping theorem. The first, uniform version is based on the constructive proof of the Riemann mapping theorem by Bishop and Bridges and formulated in the computability framework developed by Kreitz and Weihrauch. It states which ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
The main results of the paper are two effective versions of the Riemann mapping theorem. The first, uniform version is based on the constructive proof of the Riemann mapping theorem by Bishop and Bridges and formulated in the computability framework developed by Kreitz and Weihrauch. It states which topological information precisely one needs about a nonempty, proper, open, connected, and simply connected subset of the complex plane in order to compute a description of a holomorphic bijection from this set onto the unit disk, and vice versa, which topological information about the set can be obtained from a description of a holomorphic bijection. The second version, which is derived from the #rst by considering the sets and the functions with computable descriptions, characterizes the subsets of the complex plane for which there exists a computable holomorphic bijection onto the unit disk. This solves a problem posed by PourEl and Richards. We also show that this class of sets is strictl...
The emperor’s new recursiveness: The epigraph of the exponential function in two models of computability
 In Masami Ito and Teruo Imaoka, editors, Words, Languages & Combinatorics III
, 2003
"... In his book “The Emperor’s New Mind ” Roger Penrose implicitly defines some criteria which should be met by a reasonable notion of recursiveness for subsets of Euclidean space. We discuss two such notions with regard to Penrose’s criteria: one originated from computable analysis, and the one introdu ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
In his book “The Emperor’s New Mind ” Roger Penrose implicitly defines some criteria which should be met by a reasonable notion of recursiveness for subsets of Euclidean space. We discuss two such notions with regard to Penrose’s criteria: one originated from computable analysis, and the one introduced by Blum, Shub and Smale. 1
Effective Metric Spaces and Representations of the Reals
 THEORETICAL COMPUTER SCIENCE, 2002 (CCA'99 SPECIAL ISSUE
, 2000
"... Based on standard notions of classical recursion theory, a natural model of approximate computability for partial functions between effective metric spaces is presented. It generalizes the KoFriedman approach to computability of real functions by means of oracle Turing machines and avoids the ex ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Based on standard notions of classical recursion theory, a natural model of approximate computability for partial functions between effective metric spaces is presented. It generalizes the KoFriedman approach to computability of real functions by means of oracle Turing machines and avoids the explicit use of representations. The topological arithmetical hierarchy is introduced and shown to be strict if the underlying space contains an effectively discrete sequence. The domains of computable functions are just the \Pi 2 sets of that hierarchy if the space admits a finitary stratification. Finally, this framework is used to investigate and characterize the standard representations of the real numbers. They are just those functions from the name space onto the reals which have both computable extensions and inversions that are computable as relations.