Quasi-Delay-Insensitive Circuits Are Turing-Complete

doi 10.21236/ada444284
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Defense Technical Information Center

Related search

Improving DPA Resistance of Quasi Delay Insensitive Circuits Using Randomly Time-Shifted Acknowledgment Signals

English

Parallel Communicating Grammar Systems With Context-Free Components Are Turing Complete for Any Communication Model

Acta Universitatis Sapientiae, Informatica
2016English

Delay-Induced Turing Instability in Reaction-Diffusion Equations

Physical Review E
2014English

Electronically Controllable Delay Circuits

The Journal of the Institute of Television Engineers of Japan
1961English

Bounded Dataflow Networks and Latency-Insensitive Circuits

2009English

Quasi-Tridiagonal Matrices and Type-Insensitive Difference Equations

Quarterly of Applied Mathematics
Applied Mathematics
1960English

Delay Testing of PD-SOI Circuits

IEICE Electronics Express
Electronic EngineeringCondensed Matter PhysicsOpticalElectricalMagnetic MaterialsElectronic
2008English

Random Strings and Tt-Degrees of Turing Complete C.E. Sets

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2014English

A 1-Change-In-4 Delay-Insensitive Interchip Link

2010English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy