1809 search results - page 5 / 362 » Weakly Computable Real Numbers |
MOC
1998
13 years 7 months ago
1998
In this paper an unconditional probabilistic algorithm to compute the class number of a real quadratic field Q( √ d) is presented, which computes the class number in expected ti...
SIAMCOMP
2008
13 years 7 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
AML
2008
13 years 7 months ago
2008
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether def...
MFCS
2001
Springer
14 years 1 days ago
2001
Springer
SAS
2007
Springer
14 years 1 months ago
2007
Springer
