Degrees of unsolvability associated with Markov algorithms

Hughes, Charles E.

doi:10.1007/bf00987253

Cited by 4 publications

(3 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(I), (II), (III), (IV), and (V) were shown in [12], [7], [6], [9], and [8], respectively. (VI) and (VII) may be arrived at by combining the constructions of [3] with those of [7] and [9], respectively.…”

Section: Two-letter Alphabetsmentioning

confidence: 96%

“…More recent work has had as its objective the proof that these Turing degree results can be strengthened to many-one degrees. Examples of papers falling into this category are [6], [7], [8], [9], [10], and [12]. The constructions presented in each of the above lead to combinatorial systems in which the alphabets are finite but not uniformly bounded.…”

Section: Introductionmentioning

confidence: 97%

See 1 more Smart Citation

Combinatorial systems defined over one- and two-letter alphabets

Hughes

Singletary

1975

Arch math Logik

Self Cite

View full text Add to dashboard Cite

In this paper we shall investigate some families of decision problems associated with a number of combinatorial systems whose alphabets are restricted to one and two letters. Our purpose is to try to gain a better understanding of the boundaries between classes of combinatorial systems whose decision problems are solvable and those whose decision problems are of any prescribed r.e. manyone degree of unsolvability. We show that, for one-letter alphabets, the decision problems considered here for semi-Thue systems, Thue systems, Post normal systems, Markov algorithms and Post correspondence classes are each solvable. In contrast, for two-letter alphabets, each such family of decision problems represents every r.e. many-one degree of unsolvability.

show abstract

Section: Two-letter Alphabetsmentioning

confidence: 96%

Section: Introductionmentioning

confidence: 97%

Combinatorial systems defined over one- and two-letter alphabets

Hughes

Singletary

1975

Arch math Logik

Self Cite

View full text Add to dashboard Cite

show abstract

“…many-one degrees : the representation theorem for the decision problem of partial implicational propositional calculi in two variables (see HUGHES [36]), for the halting problem of Tag systems (AANDERAA, BELSNES [l]) with many-one equivalent word and halting probleni (HUGHES [32]), for the Post correspondence problem of correspondence classes resp. with arioni (CUDIA, SINGLETARY [16], HUGHES, SINGLETARY [39, chapter XI), for the word probleiri of Thue systems (OVERBEEK [53]), for the decision problem of recursive classes of first-order logical formulae with equality as only predicate symbol; the triple repraenfation theorem for halting, word and confluence problem of Turing machines (OVER-BEEK i52]), iMarkov algorithms without concluding rules (HUGHES [30]), Xarkov algorithms in Swanson…”

Section: %(Ptm)mentioning

confidence: 99%

A New General Approach to the Theory of the Many‐One Equivalence of Decision Problems for Algorithmic Systems

Börger¹

1979

Mathematical Logic Qtrly

View full text Add to dashboard Cite

Starting from POST'S [55] different notions of effective reducibility and from the fact proved by FRIEDBERG [23] and MUONIK [49] that there are recursively enumerable (r.e.) sets A , of natural numbers neither of whose decision problems 1.x . x E A , is (Turing-)reducible to the other giving incomparable r.e. degrees of unsolvability, many authors investigated the natural question as to what extent known unsolvability results could be generalized to degree analogues of them. Attention was focused on proving or disproving theorems of the following type: let A be a set of objects (for example natural numbers, machines, algorithms, logical deductive systems) and D,, . . . , D,, functions containing for every element a E A so called decision problems, i.e. pairs (a, D,(a)) with sets D,(a) (as for example halting problems, correctness problems, deducibility problems) ; one can give an effective procedure which associates to every n-tuple of degrees d,, . . . , d,, an object a E A such that D,(a) has degree d , (1 5 i n).One expresses such a fact often also by saying that every n-tuple of degrees can be effectively represented by the decision problems D,, . . ., D,& of elements of A . So we will refer to such a theorem briefly as n-tuple representation theorem for the degrees of the decision problems D, , . . . , D, of elements of A , where the particular notion of degree used has to be specified. I n the case n = 1 we omit "1-tuple". Call a pair ( A , D ) as specified above a general decision problem, i.e. a class of particular decision problems (a, D(a)). As in the case of unsolvability proofs (see for example BOONE [5], MARKOV [43], MATIJASEVIE [46], NOVIKOV [51], POST [54, [56], 1571, TURING [69 I), the main method for proving a representation theorem for the degrees of a general decision problem ( A , D ) is the effective degree preserving reduction t o ( A , D) of another general decision problem (A', D') for which the representation theorem is already known. This means that one gives an effective (normally one-one) mapping f : A' -+ A such that the corresponding decision problems D'(a') and D(f(a')) have the same degree. One then says that (A', D') is degree reducible to ( A , D ) (for the particular notion of degree considered) ; if each of them is degree reducible t o the other one they are said to be degree equivalent. SLUGLETARY [66] linked several effective Turing degree preserving reductions published in the literature for certain specific general decision problems3) together and combined them with own such reductions providing a proof of the Turing equivalence of a great number of general decision problems for algorithmic systems such as partial recursive This work is partly based on and extends the author's Habilitationsschrift [8] presented to the 2, The reader who is not acquainted with notions used in this introduction may look at $ 2 where 3, For exact references see the bibliography op. cit. Fachbereich Mathematik of the University of Miinster i. W. definitions or references to the literature are gi...

show abstract