Hierarchy Of Equivalence Relations Research Articles

The Hierarchy of Equivalence Relations on the Natural Numbers Under Computable Reducibility

The notion of computable reducibility between equivalence relations on the natural numbers provides a natural computable analogue of Borel reducibility. We investigate the computable reducibility hierarchy, comparing and contrasting it with the Borel reducibility hierarchy from descriptive set theory. Meanwhile, the notion of computable reducibility appears well suited for an analysis of equivalence relations on the c.e.\ sets, and more specifically, on various classes of c.e.\ structures. This is a rich context with many natural examples, such as the isomorphism relation on c.e.\ graphs or on computably presented groups. Here, our exposition extends earlier work in the literature concerning the classification of computable structures. An abundance of open questions remains.

The development of imprecise real-time systems

A formal model for imprecise computation is presented. The model is based on the timed failures model for timed CSP. Imprecise computation is defined through a hierarchy of equivalence relations on timed failures. The imprecision of such computation is defined by metric functions over these traces. A case study covering the inexact distributed agreement problem is developed.