Sciweavers

395 search results - page 2 / 79
» Degrees of Weakly Computable Reals
Sort
View
CCA
2009
Springer
14 years 10 days ago
Weihrauch Degrees, Omniscience Principles and Weak Computability
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
Vasco Brattka, Guido Gherardi
BMVC
2002
13 years 8 months ago
Bundle adjustment: a fast method with weak initialisation
Bundle adjustment is one of the cornerstone to recover the scene structure from a sequence of images. The main drawback of this technique, due to nonlinear optimisation, is the ne...
Sébastien Cornou, Michel Dhome, Patrick Say...
CIE
2007
Springer
13 years 7 months ago
Constructive Dimension and Weak Truth-Table Degrees
This paper examines the constructive Hausdorff and packing dimensions of weak truth-table degrees. The main result is that every infinite sequence S with constructive Hausdorff...
Laurent Bienvenu, David Doty, Frank Stephan
APAL
2007
88views more  APAL 2007»
13 years 5 months ago
Randomness and the linear degrees of computability
We show that there exists a real α such that, for all reals β, if α is linear reducible to β (α ≤ β, previously denoted α ≤sw β) then β ≤T α. In fact, every random ...
Andrew E. M. Lewis, George Barmpalias
CIE
2005
Springer
13 years 11 months ago
On the Turing Degrees of Divergence Bounded Computable Reals
The d-c.e. (difference of c.e.) and dbc (divergence bounded computable) reals are two important subclasses of ∆0 2-reals which have very interesting computability-theoretical as...
Robert Rettinger, Xizhong Zheng