8512 search results - page 248 / 1703 » Computing Theory With Relevance |
135
Voted
JCSS
2007
15 years 5 months ago
2007
We show that the elementary theory of the structure of the Solovay degrees of computably enumerable reals is undecidable.
128
click to vote
MUM
2004
ACM
15 years 10 months ago
2004
ACM
The Task Computing framework is designed to operate in dynamic ubiquitous environments in which a mobile computing user dynamically discovers the current set of available semantic...
130
Voted
CALCO
2009
Springer
15 years 11 months ago
2009
Springer
A theory of traces of computations has emerged within the field of coalgebra, via finality in Kleisli categories. In concurrency theory, traces are traditionally obtained from ex...
110
click to vote
SYNASC
2006
IEEE
15 years 11 months ago
2006
IEEE
In this paper, we report a case study of computer supported exploration of the theory of natural numbers, using a theory exploration model based on knowledge schemes, proposed by ...
140
Voted
CONCUR
2006
Springer
15 years 8 months ago
2006
Springer
This paper studies the (in)equational theory of simulation preorder and equivalence over the process algebra BCCSP. We prove that in the presence of a finite alphabet with at least...