257 search results - page 1 / 52 » Computability over The Partial Continuous Functionals |
JSYML
2000
13 years 9 months ago
2000
We show that to every recursive total continuous functional there is a representative of in the hierearchy of partial continuous functionals such that is S1 - S9 computable ov...
CIE
2006
Springer
14 years 1 months ago
2006
Springer
SIGMOD
2006
ACM
14 years 10 months ago
2006
ACM
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
AML
1999
13 years 9 months ago
1999
The paper studies a domain theoretical notion of primitive recursion over partial sequences in the context of Scott domains. Based on a non-monotone coding of partial sequences, t...
AIML
2006
13 years 11 months ago
2006
Dynamic topological logics are combinations of topological and temporal modal logics that are used for reasoning about dynamical systems consisting of a topological space and a con...