In this work, we consider error detection via simulation for reversible circuit architectures. We rigorously prove that reversibility augments the performance of simple protocol to a considerable degree. A single randomly generated input is guaranteed unveil with probability only depends on size error, not itself. Empirical studies confirm behavior typically extends multiple errors as well. con...

In speaker verification, the result of a trial is traditionally summarised as an arbitrary score, where a higher score indicates stronger evidence in favour of the speaker hypothesis. However this is difficult to interpret. It is useful to convert this score into a “confidence level”, i.e. the posterior probability that the speaker hypothesis is correct, given the score. One of the simplest for...

This paper explores the concept of “pure fault tolerance”--when a system can fulfill its computational goal, even though some of its components do not fulfill theirs. This leads to a natural statement of the composition problem for a very general concept of architecture: to what extent are the properties of a system based on that architecture a function of the properties of the components? The ...