429 search results - page 30 / 86 » Turing computations on ordinals |
LICS
2008
IEEE
15 years 6 months ago
2008
IEEE
We show that reachability and termination for lossy channel systems is exactly at level Fωω in the Fast-Growing Hierarchy of recursive functions, the first level that dominates...
ICALP
2009
Springer
16 years 2 days ago
2009
Springer
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
EUROCOLT
1999
Springer
15 years 4 months ago
1999
Springer
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
103
click to vote
ECCV
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. The randomness of iris pattern makes it one of the most reliable biometric traits. On the other hand, the complex iris image structure and various sources of intra-class ...
WSC
2004
15 years 1 months ago
2004
We consider the problem of optimal allocation of computing budget to maximize the probability of correct selection in the ordinal optimization setting. This problem has been studi...