Every incomplete computably enumerable truth-table degree is branching

2001 ◽  
Vol 40 (2) ◽  
pp. 113-123
Author(s):  
Peter A. Fejer ◽  
Richard A. Shore
Keyword(s):  
Truth Table ◽  
Computably Enumerable

On the construction of effectively random sets

2004 ◽  
Vol 69 (3) ◽  
pp. 862-878 ◽  
Author(s):  
Wolfgang Merkle ◽  
Nenad Mihailović
Keyword(s):  
Truth Table ◽  
Random Sets ◽  
Random Set ◽  
Basic Construction ◽  
Computably Enumerable

Abstract.We present a comparatively simple way to construct Martin-Löf random and rec-random sets with certain additional properties, which works by diagonalizing against appropriate martingales. Reviewing the result of Gács and Kučera, for any given set X we construct a Martin-Löf random set from which X can be decoded effectively.By a variant of the basic construction we obtain a rec-random set that is weak truth-table autoreducible and we observe that there are Martin-Löf random sets that are computably enumerable self-reducible. The two latter results complement the known facts that no rec-random set is truth-table autoreducible and that no Martin-Löf random set is Turing-autoreducible [8, 24].

Contiguity and distributivity in the enumerable Turing degrees — Corrigendum

2002 ◽  
Vol 67 (4) ◽  
pp. 1579-1580
Author(s):  
Rodney G. Downey ◽  
Steffen Lempp
Keyword(s):  
Truth Table ◽  
Turing Degree ◽  
Turing Degrees ◽  
Computably Enumerable Set ◽  
Enumerable Degree ◽  
Computably Enumerable Sets ◽  
Image Position ◽  
Computably Enumerable Degree ◽  
Computably Enumerable

A computably enumerable Turing degree a is called contiguous iff it contains only a single computably enumerable weak truth table degree (Ladner and Sasso [2]). In [1], the authors proved that a nonzero computably enumerable degree a is contiguous iff it is locally distributive, that is, for all a1, a2, c with a1 ∪a2 = a and c ≤ a, there exist ci, ≤ ai with c1 ∪ c2 = c.To do this we supposed that W was a computably enumerable set and ∪ a computably set with a Turing functional Φ such that ΦW = U. Then we constructed computably enumerable sets A0, A1 and B together with functionals Γ0, Γ1, Γ, and Δ so thatand so as to satisfy all the requirements below.That is, we built a degree-theoretical splitting A0, A1 of W and a set B ≤TW such that if we cannot beat all possible degree-theoretical splittings V0, V1 of B then we were able to witness the fact that U ≤WW (via Λ).After the proof it was observed that the set U of the proof (page 1222, paragraph 4) needed only to be Δ20. It was then claimed that a consequence to the proof was that every contiguous computably enumerable degree was, in fact, strongly contiguous, in the sense that all (not necessarily computably enumerable) sets of the degree had the same weak truth table degree.

scholarly journals Calibrating word problems of groups via the complexity of equivalence relations

2016 ◽  
Vol 28 (3) ◽  
pp. 457-471 ◽  
Author(s):  
ANDRÉ NIES ◽  
ANDREA SORBI
Keyword(s):  
Word Problem ◽  
Equivalence Relation ◽  
Word Problems ◽  
Truth Table ◽  
Equivalence Relations ◽  
Finitely Generated ◽  
Finitely Generated Group ◽  
Finitely Presented Group ◽  
Finitely Presented ◽  
Computably Enumerable

(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal co-computably enumerable equivalence relation. (3) Each c.e. truth-table degree contains the word problem of a finitely generated group of computable permutations.

Degrees of sets having no subsets of higher m- and t t-degree

Computability ◽  
2021 ◽  
pp. 1-21
Author(s):  
Patrizio Cintioli
Keyword(s):  
Truth Table ◽  
Partially Ordered ◽  
Computably Enumerable

We consider sets without subsets of higher m- and t t-degree, that we call m-introimmune and t t-introimmune sets respectively. We study how they are distributed in partially ordered degree structures. We show that: each computably enumerable weak truth-table degree contains m-introimmune Π 1 0 -sets; each hyperimmune degree contains bi-m-introimmune sets. Finally, from known results we establish that each degree a with a ′ ⩾ 0 ″ covers a degree containing t t-introimmune sets.

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.

Sign in / Sign up

Export Citation Format

Share Document