CIE
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. If L is a finite relational language then all computable Lstructures can be effectively enumerated in a sequence {An}n∈ω in such a way that for every computable L-st...
CCA
2009
Springer
14 years 7 months ago
2009
Springer
We exhibit a polynomial time computable plane curve Γ that has finite length, does not intersect itself, and is smooth except at one endpoint, but has the following property. For...
ICDCN
2009
Springer
14 years 7 months ago
2009
Springer
Chandy et al. proposed the methodology of “self-similar algorithms” for distributed computation in dynamic environments. We further characterize the class of functions computab...