Comparison of linear reducibility with other reducibilities of tabular type

1982 ◽  
Vol 21 (5) ◽  
pp. 339-353 ◽  
Author(s):  
A. N. Degtev
Keyword(s):  
Tabular Type

Fabrication of high power density tabular type solid oxide fuel cells

1994 ◽  
Vol 72 ◽  
pp. 253-256 ◽  
Author(s):  
H. Sasaki ◽  
S. Otoshi ◽  
M. Suzuki ◽  
T. Sogi ◽  
A. Kajimura ◽  
...  
Keyword(s):  
Fuel Cells ◽  
Solid Oxide Fuel Cells ◽  
Power Density ◽  
High Power ◽  
Solid Oxide ◽  
High Power Density ◽  
Oxide Fuel ◽  
Tabular Type

Genesis of the tabular-type vanadium-uranium deposits of the Henry Basin, Utah; reply

1991 ◽  
Vol 86 (6) ◽  
pp. 1353-1355 ◽  
Author(s):  
Martin B. Goldhaber ◽  
Richard B. Wanty ◽  
Gary P. Landis ◽  
Richard L. Reynolds ◽  
Richard I. Grauch ◽  
...  
Keyword(s):  
Uranium Deposits ◽  
Tabular Type

A new model for tabular-type uranium deposits

1992 ◽  
Vol 87 (8) ◽  
pp. 2041-2055 ◽  
Author(s):  
Richard F. Sanford
Keyword(s):  
Uranium Deposits ◽  
New Model ◽  
Tabular Type

Genesis of the tabular-type vanadium-uranium deposits of the Henry Basin, Utah

1990 ◽  
Vol 85 (2) ◽  
pp. 215-269 ◽  
Author(s):  
H. Roy Northrop ◽  
Martin B. Goldhaber ◽  
Gary P. Landis ◽  
John W. Unruh ◽  
Richard L. Reynolds ◽  
...  
Keyword(s):  
Uranium Deposits ◽  
Tabular Type

Undecidability and initial segments of the (r.e.) tt-degrees

1990 ◽  
Vol 55 (3) ◽  
pp. 987-1006 ◽  
Author(s):  
Christine Ann Haught ◽  
Richard A. Shore
Keyword(s):  
Turing Machine ◽  
Recursive Function ◽  
Equivalence Classes ◽  
Truth Table ◽  
Turing Degree ◽  
General Notion ◽  
Basic Information ◽  
Recursive Procedure ◽  
Tabular Type

A notion of reducibility ≤r between sets is specified by giving a set of procedures for computing one set from another. We say that a set A is r-reducible to a set B, A ≤rB, if one of the procedures applied to B gives A. Associated with any such reducibility notion is the structure of r-degrees, the equivalence classes of sets with respect to this reducibility, with the induced ordering. The most general notion of a computable reducibility is that of Turing, ≤T. Here we say that A ≤TB if there is a Turing machine φe which, when equipped with an oracle for B, computes A: φeB = A. Such Turing degree computations are characterized by the phenomenon that only during the computation itself do we discover which questions about B need to be answered to compute A(x). In contrast, for nearly all other computable reducibilities the set of questions needed is given in advance by a recursive procedure. Perhaps the most common example of such a procedure is many-one reducibility, ≤m: A ≤mB if there is a recursive function f such that x ∈ A ⇔ f(x) ∈ B.Reducibilities with the property that the output, A(x), is determined by the answers that B gives to a set of questions calculated recursively from x are said to be of tabular type. The most general tabular reducibility is called truth-table reducibility, ≤tt. The procedures [e] associated with this reducibility are specified by a recursive function f (= {e}) which, for each x, gives a set of n questions about the oracle and, for each of the possible 2n sets of answers, gives the corresponding output. As usual this defines A ≤ttB as “there is an e such that [e]B = A”. It is with this notion of reducibility and the associated tt-degrees that we shall be concerned in this paper. Basic information on several such strong reducibilities can be found in Rogers [28]. For more information we recommend the survey articles by Odifreddi [25] and Degtev [2] as well as Odifreddi's book [26].

Sign in / Sign up

Export Citation Format

Share Document