Collaboration in nature is often illustrated through the collective behavior of ants. Although entomological studies have shown that certain goals are well-served by this collective behavior, the extent of what such a collaboration can achieve is not immediately clear. We extend past work that has argued that ants are, in principle, able to collectively compute logical circuits, and illustrate ...

[This paper develops the notion of perceptual hypotheses and also raises questions concerning the distinction to be made between ‘analogue’ and ‘digital’. This is made in the context of the brain, and seems important if we are to be clear in how we use an engineering distinction. The point is: Should the distinction be regarded as one of engineering convenience (continuous or discontinuous mech...

Recently, thermal-aware digital circuit design in advanced technologies is great challenges to realize high-speed and robust microprocessors. In this paper, we explore temperature gradient alleviating method for arithmetic units. Aiming at alleviating temperature gradients at logical circuit design level, we try to flatten out a power density by applying delay-balancing technique for equaldelay...

When lipid vesicles filled with Belousov-Zhabotinsky (BZ) excitable chemical medium are packed in tight assembles, waves of excitation may travel between the vesicles. When several waves meet in a vesicle some fragments may deflect, others can annihilate or continue their travel undisturbed. By interpreting waves as Boolean values we can construct logical gates and assemble them in large circui...

More than fifty years after its introduction by Alonzo Church, the synthesis problem is still one of the most intriguing challenges in the theory of reactive systems. On the one hand, synthesis algorithms have found applications in many areas of systems engineering, from the construction and optimization of circuits and device drivers to the synthesis of controllers for robots and manufacturing...

What is the minimum number of extra qubits needed to perform a large fault-tolerant quantum circuit? Working in a common model of fault-tolerance, I show that in the asymptotic limit of large circuits, the ratio of physical qubits to logical qubits can be a constant. The construction makes use of quantum low-density parity check codes, and the asymptotic overhead of the protocol is equal to tha...

This paper presents new circuit configurations for a more robust and efficient form of self-resetting CMOS (SRCMOS). Prior structures for SRCMOS have very high performance but are difficult to design and are not robust over process, temperature and voltage variations. The new techniques replace delay chains with logical circuits that will create pulses at the correct times, independent of opera...

This is a technical report about a theory named Automata. Automata is an arithmetic for synchronous circuits. It provides means for representing and transforming circuit descriptions at the RT level and gate level in a mathemtical manner. Automata has been implemented in the HOL theorem proving environment. Preproven theorems are designed for performing standard synthesis steps such as state en...

The present work is devoted to the development of software tool written in Java for synthesis of asynchronous speed-independent circuits. A special type of Petri nets Signal Transition Graph, was used for the synthesis. Using the algorithm based on the theory of regions, a logic function is derived from this graph. In order to reduce the complexity of the resulting asynchronous circuit the numb...

Computing circuits composed of noisy logical gates and their ability to represent arbitrary boolean functions with a given level of error are investigated within a statistical mechanics setting. Existing bounds on their performance are straightforwardly retrieved, generalized, and identified as the corresponding typical-case phase transitions. Results on error rates, function depth, and sensiti...