Sciweavers

CIE
2009
Springer
13 years 10 months ago
Equivalence Relations on Classes of Computable Structures
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...
Ekaterina B. Fokina, Sy-David Friedman
CCA
2009
Springer
13 years 10 months ago
Curves That Must Be Retraced
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...
Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo
ICDCN
2009
Springer
13 years 10 months ago
Self-similar Functions and Population Protocols: A Characterization and a Comparison
Chandy et al. proposed the methodology of “self-similar algorithms” for distributed computation in dynamic environments. We further characterize the class of functions computab...
Swapnil Bhatia, Radim Bartos