| |
Rajit Manohar and Alain J. Martin
Quasi-delay-insensitive (QDI) circuits are those whose correct operation
does not depend on the delays of operators or wires, except for certain
wires that form isochronic forks. In this paper we show that
quasi-delay-insensitivity, stability and non-interference, and strong
confluence are equivalent properties of a computation. In particular, this
shows that QDI computations are deterministic. We show that the class of
Turing-computable functions have QDI implementations by constructing
a QDI Turing machine.
|
|
