429 search results - page 37 / 86 » Turing computations on ordinals |
116
click to vote
JCSS
2000
14 years 11 months ago
2000
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n1+o(1) time and n1space for an...
102
click to vote
ICCV
2011
IEEE
13 years 11 months ago
2011
IEEE
This paper presents a novel method for feature description based on intensity order. Specifically, a Local Intensity Order Pattern(LIOP) is proposed to encode the local ordinal i...
BSL
2006
14 years 12 months ago
2006
We give a self-contained and streamlined version of the classification of the provably computable functions of PA. The emphasis is put on illuminating as good as seems possible th...
104
click to vote
IICS
2009
Springer
15 years 6 months ago
2009
Springer
: User generated content is a valuable resource voluntarily provided by a growing number of users. As online and traditional businesses increasingly harness this resource the need ...
120
click to vote
MFCS
2001
Springer
15 years 4 months ago
2001
Springer
We consider words indexed by linear orderings. These extend finite, (bi-)infinite words and words on ordinals. We introduce finite automata and rational expressions for these w...