scholarly journals Truth-table Schnorr randomness and truth-table reducible randomness

2011 ◽  
Vol 57 (3) ◽  
pp. 323-338 ◽  
Author(s):  
Kenshi Miyabe
Keyword(s):  
Truth Table ◽  
Schnorr Randomness

Combinational Logic Analysis Using Laser Voltage Probing

2015 ◽  
Author(s):  
Venkat Krishnan Ravikumar ◽  
Winson Lua ◽  
Seah Yi Xuan ◽  
Gopinath Ranganathan ◽  
Angeline Phoa
Keyword(s):  
Failure Analysis ◽  
Continuous Wave ◽  
Truth Table ◽  
Combinational Logic ◽  
Infra Red ◽  
Analysis Design ◽  
Logic State

Abstract Laser Voltage Probing (LVP) using continuous-wave near infra-red lasers are popular for failure analysis, design and test debug. LVP waveforms provide information on the logic state of the circuitry. This paper aims to explain the waveforms observed from combinational circuitries and use it to rebuild the truth table.

scholarly journals Π10 classes and strong degree spectra of relations

2007 ◽  
Vol 72 (3) ◽  
pp. 1003-1018 ◽  
Author(s):  
John Chisholm ◽  
Jennifer Chubb ◽  
Valentina S. Harizanov ◽  
Denis R. Hirschfeldt ◽  
Carl G. Jockusch ◽  
...  
Keyword(s):  
Kolmogorov Complexity ◽  
Initial Segment ◽  
Truth Table ◽  
Linear Ordering ◽  
Computable Structures ◽  
Degree Spectra

AbstractWe study the weak truth-table and truth-table degrees of the images of subsets of computable structures under isomorphisms between computable structures. In particular, we show that there is a low c.e. set that is not weak truth-table reducible to any initial segment of any scattered computable linear ordering. Countable subsets of 2ω and Kolmogorov complexity play a major role in the proof.

The theory of the recursively enumerable weak truth-table degrees is undecidable

1992 ◽  
Vol 57 (3) ◽  
pp. 864-874 ◽  
Author(s):  
Klaus Ambos-Spies ◽  
André Nies ◽  
Richard A. Shore
Keyword(s):  
Partial Order ◽  
Open Problem ◽  
Truth Table ◽  
Recursively Enumerable ◽  
Undecidable Theory ◽  
Weak Truth Table Degrees

AbstractWe show that the partial order of -sets under inclusion is elementarily definable with parameters in the semilattice of r.e. wtt-degrees. Using a result of E. Herrmann, we can deduce that this semilattice has an undecidable theory, thereby solving an open problem of P. Odifreddi.

IDENTIFICATION AND REALIZATION OF LINEARLY SEPARABLE BOOLEAN FUNCTIONS VIA CELLULAR NEURAL NETWORKS

2008 ◽  
Vol 18 (11) ◽  
pp. 3299-3308 ◽  
Author(s):  
BO MI ◽  
XIAOFENG LIAO ◽  
CHUANDONG LI
Keyword(s):  
Neural Networks ◽  
Directed Graph ◽  
Boolean Functions ◽  
Cellular Neural Networks ◽  
Truth Table

In this paper, an effective method for identifying and realizing linearly separable Boolean functions (LSBF) of six variables via Cellular Neural Networks (CNN) is presented. We characterized the basic relations between CNN genes and the truth table of Boolean functions. In order to implement LSBF independently, a directed graph is employed to sort the offset levels according to the truth table. Because any linearly separable Boolean gene (LSBG) can be derived separately, our method will be more practical than former schemes [Chen & Chen, 2005a, 2005b; Chen & He, 2006].

Logical Characterizations of Bounded Query Classes I: Logspace Oracle Machines

1993 ◽  
Vol 18 (1) ◽  
pp. 65-92
Author(s):  
Iain A. Stewart
Keyword(s):  
Truth Table ◽  
Complexity Class ◽  
Polynomial Hierarchy ◽  
Complexity Classes ◽  
Turing Machines ◽  
Complete Problems

We consider three sub-logics of the logic (±HP)*[FOs] and show that these sub-logics capture the complexity classes obtained by considering logspace deterministic oracle Turing machines with oracles in NP where the number of oracle calls is unrestricted and constant, respectively; that is, the classes LNP and LNP[O(1)]. We conclude that if certain logics are of the same expressibility then the Polynomial Hierarchy collapses. We also exhibit some new complete problems for the complexity class LNP via projection translations (the first to be discovered: projection translations are extremely weak logical reductions between problems) and characterize the complexity class LNP[O(1)] as the closure of NP under a new, extremely strict truth-table reduction (which we introduce in this paper).

PROCEDURES FOR LOGIC AND ARITHMETIC OPERATIONS WITH DNA MOLECULES

2004 ◽  
Vol 15 (03) ◽  
pp. 461-474 ◽  
Author(s):  
AKIHIRO FUJIWARA ◽  
KEN'ICHI MATSUMOTO ◽  
WEI CHEN
Keyword(s):  
Truth Table ◽  
Boolean Operation ◽  
Dna Molecules ◽  
Boolean Operations ◽  
Arithmetic Operations ◽  
Input And Output ◽  
Dna Strands ◽  
Logic Operations ◽  
N Additions

In this paper, we consider procedures for logic and arithmetic operations with DNA molecules. We first show a DNA representation of n binary numbers of m bits, and propose a procedure to assign the same values for the representation. The representation enables addressing feature, and the procedure is applicable to n binary numbers of m bits in O(1) steps in parallel. Next, we propose a procedure for logic operations. The procedure enables any boolean operation whose input and output are defined by a truth table, and executes different kinds of boolean operations simultaneously for any pair of n binary numbers of m bits in O(1) lab steps using O(mn) DNA strands. Finally, we propose a procedure for additions of pairs of two binary numbers. The procedure executes O(n) additions of two m-bit binary numbers in O(1) steps using O(mn) DNA strands.

Sign in / Sign up

Export Citation Format

Share Document