Gunnar Hoest

Learn More
This paper introduces the use of topological models and methods, formerly used to analyze computability, as tools for the quantification and classification of asynchronous complexity. We present the first asynchronous complexity theorem, applied to decision tasks in the iterated immediate snapshot (IIS) model of Borowsky and Gafni. We do so by introducing a(More)
Thh paper introduces the use of topological models and methods, formerly used to analyse computability, se tools for the quantification and classification of aqnchrvnoua compl-”ty. We present the first asynchronous complecit~ theorem, ap plied to decision tasks in● generalisation of Borowsky and Gafni’s Iterated Immcdistc Snap-hot (IIS) model. We do ●o by(More)
  • 1