Colorless tasks are solvable against a compact adversary iff there exists a spectral map from the projective limit of protocol states to the output space compatible with the task specification.
The topological structure of asynchronous computability
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DC 2verdicts
UNVERDICTED 2representative citing papers
Lecture notes compiling standard topics and results in distributed systems theory from basic communication to population protocols and topological methods.
citing papers explorer
-
Stone Duality Proofs for Colorless Distributed Computability Theorems
Colorless tasks are solvable against a compact adversary iff there exists a spectral map from the projective limit of protocol states to the output space compatible with the task specification.