Sciweavers

429 search results - page 9 / 86
» Turing computations on ordinals
Sort
View
CIE
2007
Springer
15 years 3 months ago
Thin Maximal Antichains in the Turing Degrees
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 ...
Chi Tat Chong, Liang Yu
CIE
2007
Springer
15 years 3 months ago
The Complexity of Quickly ORM-Decidable Sets
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...
Joel David Hamkins, David Linetsky, Russell G. Mil...
FCT
2005
Springer
15 years 3 months ago
On the Power of Unambiguity in Alternating Machines
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...
Holger Spakowski, Rahul Tripathi
RTA
1997
Springer
15 years 1 months ago
A Complete Axiomatisation for the Inclusion of Series-Parallel Partial Orders
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,...
Denis Béchet, Philippe de Groote, Christian...
ACMACE
2006
ACM
15 years 3 months ago
A fast eye location method using ordinal features
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...
Xuetao Feng, Yangsheng Wang, Li Bai