1809 search results - page 8 / 362 » Weakly Computable Real Numbers |
COCOON
2005
Springer
13 years 9 months ago
2005
Springer
A c.e. real x is Solovay reducible to another c.e. real y if x can be approximated at least as efficiently as y by means of increasing computable sequences of rational numbers. The...
ARITH
1997
IEEE
13 years 12 months ago
1997
IEEE
ANTS
2010
Springer
13 years 11 months ago
2010
Springer
We extend methods of Greenberg and the author to compute in the cohomology of a Shimura curve defined over a totally real field with arbitrary class number. Via the Jacquet-Langlan...
WSS
2001
13 years 9 months ago
2001
We investigate a new property of computing systems called weak stabilization. Although this property is strictly weaker than the well-known property of stabilization, weak stabiliz...
MLQ
2002
13 years 7 months ago
2002
A real number is recursively approximable if there is a computable sequence of rational numbers converging to it. If some extra condition to the convergence is added, then the limi...