429 search results - page 74 / 86 » Turing computations on ordinals |
131
click to vote
COCO
1999
Springer
15 years 6 months ago
1999
Springer
Recent work by Bernasconi, Damm and Shparlinski showed that the set of square-free numbers is not in AC0 , and raised as an open question whether similar (or stronger) lower bound...
117
Voted
ICDT
1999
ACM
15 years 6 months ago
1999
ACM
Abstract. In this paper we present a new approach for studying aggregations in the context of database query languages. Starting from a broad de nition of aggregate function, we ad...
131
Voted
CIAC
2010
Springer
15 years 5 months ago
2010
Springer
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
101
Voted
CIE
2007
Springer
15 years 3 months ago
2007
Springer
This paper examines the constructive Hausdorff and packing dimensions of weak truth-table degrees. The main result is that every infinite sequence S with constructive Hausdorff...
110
Voted
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Pure, or type-free, Linear Logic proof nets are Turing complete once cut-elimination is5 considered as computation. We introduce modal impredicativity as a new form of impredicati...