429 search results - page 9 / 86 » Turing computations on ordinals |
131
click to vote
CIE
2007
Springer
16 years 7 days ago
2007
Springer
Abstract. We study existence problems of maximal antichains in the Turing degrees. In particular, we give a characterization of the existence of a thin Π1 1 maximal antichains in ...
146
click to vote
CIE
2007
Springer
16 years 7 days ago
2007
Springer
Abstract. The Ordinal Register Machine (ORM) is one of several different machine models for infinitary computability. We classify, by complexity, the sets that can be decided quic...
147
click to vote
FCT
2005
Springer
15 years 11 months ago
2005
Springer
Unambiguity in alternating Turing machines has received considerable attention in the context of analyzing globally-unique games by Aida et al. [ACRW04] and in the design of effic...
158
click to vote
RTA
1997
Springer
15 years 10 months ago
1997
Springer
Series-parallel orders are de ned as the least class of partial orders containing the one-element order and closed by ordinal sum and disjoint union. From this inductive de nition,...
130
click to vote
ACMACE
2006
ACM
16 years 1 days ago
2006
ACM
Automatic facial feature location is an important step in humancomputer interaction and automatic face recognition. In this paper, a new eye location method is proposed. A classif...