Quasi-Delay-Insensitive Circuits are Turing-Complete

Authors:
Rajit Manohar;Alain J. Martin
Affiliations:
-;-
Venue:
Quasi-Delay-Insensitive Circuits are Turing-Complete
Year:
1995

Citing 0
Cited 2

SNAP: A Sensor-Network Asynchronous Processor

ASYNC '03 Proceedings of the 9th International Symposium on Asynchronous Circuits and Systems
Crosstalk-glitch gating: a solution for designing glitch-tolerant asynchronous handshake interface mechanisms for GALS systems

IEEE Transactions on Circuits and Systems Part I: Regular Papers

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 noninterference, 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.