429 search results - page 25 / 86 » Turing computations on ordinals |
MOC
2011
14 years 16 days ago
2011
Abstract. This article improves the estimate of the size of the definite integral of S(t), the argument of the Riemann zeta-function. The primary application of this improvement i...
IPL
2000
14 years 9 months ago
2000
A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons ...
ECIR
2009
Springer
15 years 6 months ago
2009
Springer
CIE
2005
Springer
15 years 3 months ago
2005
Springer
FOCS
2003
IEEE
15 years 3 months ago
2003
IEEE
While deciphering the Enigma Code during World War II, I.J. Good and A.M. Turing considered the problem of estimating a probability distribution from a sample of data. They derive...