Related papers: On plant roots logical gates
Quantum Hamiltonian Computing is a recent approach that uses quantum systems, in particular a single molecule, to perform computational tasks. Within this approach, we present explicit methods to construct logic gates using two different…
Binary relations are one of the standard ways to encode, characterise and reason about graphs. Relation algebras provide equational axioms for a large fragment of the calculus of binary relations. Although relations are standard tools in…
We present a general method for analysing novel computational substrates to determine which of their parameters can be manipulated to exhibit the complete set of 2-input boolean logical operations. We demonstrate this approach with an…
We design logic circuits based on the notion of zero forcing on graphs; each gate of the circuits is a gadget in which zero forcing is performed. We show that such circuits can evaluate every monotone Boolean function. By using two vertices…
An abelian processor is an automaton whose output is independent of the order of its inputs. Bond and Levine have proved that a network of abelian processors performs the same computation regardless of processing order (subject only to a…
We present a form of algebraic reasoning for computational objects which are expressed as graphs. Edges describe the flow of data between primitive operations which are represented by vertices. These graphs have an interface made of…
In literature, NAND and NOR are two logic gates that display functional completeness, hence regarded as Universal gates. So, the present effort is focused on exploring a library of universal gates in binary that are still unexplored in…
In modern computers, computation is performed by assembling together sets of logic gates. Popular gates like AND, OR, XOR, processing two logic inputs and yielding one logic output, are often addressed as irreversible logic gates where the…
Invertible logic can operate in one of two modes: 1) a forward mode, in which inputs are presented and a single, correct output is produced, and 2) a reverse mode, in which the output is fixed and the inputs take on values consistent with…
A general discussion of the conformal Ward identities is presented in the context of logarithmic conformal field theory with conformal Jordan cells of rank two. The logarithmic fields are taken to be quasi-primary. No simplifying…
We consider a realization of the XOR logic gate in a system involving two competing biocatalytic reactions, for which the logic-1 output is defined by these two processes causing a change in the optically detected signal. A model is…
A simple electrical network model, having logical gate capacities, is proposed here for computations in plant cells. It is compared and contrasted with the animal brain network structure and functions.
We present families of combinatorial classes described as trees with nodes that can carry one of two types of "flowers": integer partitions or integer compositions. Two parameters on the flowers of trees will be considered: the number of…
A method for synthesizing quantum gates is presented based on interpolation methods applied to operators in Hilbert space. Starting from the diagonal forms of specific generating seed operators with non-degenerate eigenvalue spectrum one…
Reversible logic can provide lower switching energy costs relative to all irreversible logic, including those developed by industry in semiconductor circuits, however, more research is needed to understand what is possible. Superconducting…
The paper has a form of a survey and consists of three parts. It is focused on the relationship between the many-sorted theory, which leads to logical geometry and one-sorted theory, which is based on the important model-theoretic concepts.…
Noise-based logic, by utilizing its multidimensional logic hyperspace, has significant potential for low-power parallel operations in beyond-Moore-chips. However universal gates for Boolean logic thus far had to rely on either time…
With the advancement of synthetic biology, several new tools have been conceptualized over the years as alternative treatments for current medical procedures. Most of those applications are applied to various chronic diseases. This work…
Bialgebrae provide an abstract framework encompassing the semantics of different kinds of computational models. In this paper we propose a bialgebraic approach to the semantics of logic programming. Our methodology is to study logic…
Regular tree grammars and regular path expressions constitute core constructs widely used in programming languages and type systems. Nevertheless, there has been little research so far on frameworks for reasoning about path expressions…