Hostname: page-component-cd9895bd7-7cvxr Total loading time: 0 Render date: 2024-12-25T19:38:06.800Z Has data issue: false hasContentIssue false
  • English
  • Français

Degree problems for modular machines

Published online by Cambridge University Press:  12 March 2014

Daniel E. Cohen
Daniel E. Cohen*
Affiliation:
Queen Mary College, London E1 4NS, England
Get access Rights & Permissions [Opens in a new window]

Extract

Modular machines were introduced in [1] and [2], where they were used to give simple proofs of various unsolvability results in group theory. Here we discuss the degrees of the halting, word, and confluence problems for modular machines, both for their own sake and in the hope that the results may be useful in group theory (see [4] for an application of a related result to group theory).

In the course of the analysis, I found it convenient to compare degrees of these problems for a Turing machine T and for a Turing machine T1 obtained from T by enlarging the alphabet but retaining the same quintuples (or quadruples). The results were surprising. The degree for a problem of T1 depends not just on the corresponding degree for T, but also on the degrees of the corresponding problems when T is restricted to a semi-infinite tape (both semi-infinite to the right and semi-infinite to the left). For the halting and confluence problems, the Turing degrees of the problems for these three machines can be any r.e. degrees. In particular the halting problem of T can be solvable, while that of T1 has any r.e. degree.

A machine M (in the general sense) consists of a countable set of configurations (together with a numbering, which we usually take for granted), a recursive subset of configurations called the terminal configurations, and a recursive function, written C ⇒ C′, on the set of configurations. If, for some n ≥ 0, we have C = C0 ⇒ C1 ⇒ … ⇒ Cn = C′, we write C → C′. We say M halts from C if C → C′ for some terminal C′.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 45 , Issue 3 , September 1980 , pp. 510 - 528
Copyright
Copyright © Association for Symbolic Logic 1980

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Aanderaa, S. and Cohen, D. E., Modular machines, the word problem for finitely presented groups and Collins' theorem, Word problems. II. The Oxford Book, Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1979.Google Scholar
[2]Aanderaa, S. and Cohen, D. E., Modular machines and the Higman-Clapham-Valiev embedding theorem, Word problems. II. The Oxford Book, Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1979.Google Scholar
[3]Börger, E., A new general approach to the theory of the many-one equivalence of decision problems for algorithmic systems, Zeitschrifit für Mathemaiische Logik und Grundlagen der Mathematik, vol. 25 (1979), pp. 135–162.CrossRefGoogle Scholar
[4]Collins, D. J., Representation of Turing reducibility by word and conjugacy problems in finitely presented groups, Acta Mathematica, vol. 128 (1972), pp. 73–90.CrossRefGoogle Scholar
[5]Overbeek, R., The representation of many-one degrees by decision problems of Turing machines, Proceedings of the London Mathematical Society, (3), vol. 26 (1973), pp. 167–183.CrossRefGoogle Scholar
[6]Rogers, H., Theory of recursive functions and effective computability, McGraw-Hill, New York, 1967.Google Scholar
[7]Shepherdson, J. C., Machine configurations and word problems of given degree of unsolvability, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 11 (1965), pp. 149–175.CrossRefGoogle Scholar