429 search results - page 25 / 86 » Turing computations on ordinals |
167
click to vote
MOC
2011
14 years 9 months 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...
158
click to vote
IPL
2000
15 years 6 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 ...
CIE
2005
Springer
16 years 8 days ago
2005
Springer
172
click to vote
FOCS
2003
IEEE
16 years 14 hour 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...