395 search results - page 3 / 79 » Degrees of Weakly Computable Reals |
EUC
2005
Springer
14 years 2 months ago
2005
Springer
BSL
2005
13 years 8 months ago
2005
A mass problem is a set of Turing oracles. If P and Q are mass problems, we say that P is weakly reducible to Q if every member of Q Turing computes a member of P. We say that P i...
JCSS
2007
13 years 8 months ago
2007
We show that the elementary theory of the structure of the Solovay degrees of computably enumerable reals is undecidable.
ESA
2004
Springer
14 years 2 months ago
2004
Springer
We study polynomials of degree up to 4 over the rationals or a computable real subfield. Our motivation comes from the need to evaluate predicates in nonlinear computational geome...
DCG
2002
13 years 8 months ago
2002
We study the map which sends vectors of polynomials into their Wronski determinants. This defines a projection map of a Grassmann variety which we call a Wronski map. Our main res...