8512 search results - page 36 / 1703 » Computing Theory With Relevance |
MFCS
1993
Springer
14 years 3 days ago
1993
Springer
We present the different constructive definitions of real number that can be found in the literature. Using domain theory we analyse the notion of computability that is substant...
AAAI
1998
13 years 9 months ago
1998
We consider computational issues in combining logical knowledge bases represented by their characteristic models; in particular, we study taking their logical intersection. We pre...
CIE
2005
Springer
14 years 1 months ago
2005
Springer
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length ω to computations on tapes of arbitrary ordinal length. The general...
JSYML
2007
13 years 8 months ago
2007
In this paper we answer the following well-known open question in computable model theory. Does there exist a computable not ℵ0-categorical saturated structure with a unique com...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we study the link between formal and cryptographic models for security protocols in the presence of a passive adversary. In contrast to other works, we do not conside...