Skip to main content
Log in

Representation of turing reducibility by word and conjugacy problems in finitely presented groups

  • Published:
Acta Mathematica

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. Bokut', L. A., On a property of groups of Boone. (Russian.)Algebra i Logika Sem., 5 (1966), no. 5, 5–23; 6 (1967), no. 1, 15–24.

    MATH  MathSciNet  Google Scholar 

  2. —, On groups of Novikov. (Russian.)Algebra i Logika Sem., 6 (1967), no. 1, 25–37.

    MATH  MathSciNet  Google Scholar 

  3. —, Degrees of unsolvability of the conjugacy problem for finitely presented groups. (Russian.)Algebra i Logika Sem., 7 (1968), no. 5, 4–70; no. 6, 4–52.

    MATH  MathSciNet  Google Scholar 

  4. Boone, W. W., Word problems and recursively enumerable degrees of unsolvability. A sequel on finitely presented groups.Ann. of Math., 84 (1966), 49–84.

    Article  MATH  MathSciNet  Google Scholar 

  5. Britton, J. L., The word problem.Ann. of Math., 77 (1963), 16–32.

    Article  MATH  MathSciNet  Google Scholar 

  6. Clapham, C. R. J., Finitely presented groups with word problems of arbitrary degrees of insolvability.Proc. Lond. Math. Soc., Series 3, 14 (1964), 633–676.

    MATH  MathSciNet  Google Scholar 

  7. Collins, D. J., Recursively enumerable degrees and the conjugacy problem.Acta Math., 122 (1969), 115–160.

    Article  MATH  MathSciNet  Google Scholar 

  8. Fridman, A. A., Degrees of unsolvability of the problem of identity in finitely presented groups.Soviet Math. Doklady, 3 (1962), 1733–1737.

    Google Scholar 

  9. —,Degrees of unsolvability of the word problem for finitely defined groups. (Russian.) Izdatel'stvo “Nauka”, Moscow 1967.

    Google Scholar 

  10. Miller, III, C. F.,On group-theoretic decision problems and their classification. Thesis, University of Illinois 1969 (see alsoJ. Symb. Logic 32 (1967), 441).

  11. Shepherdson, J. C., Machine configurations and word problems of given degree of unsolvability.Z. Math. Logik Grundlagen Math., 11 (1965), 149–175.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Collins, D.J. Representation of turing reducibility by word and conjugacy problems in finitely presented groups. Acta Math. 128, 73–90 (1972). https://doi.org/10.1007/BF02392160

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02392160

Keywords

Navigation