Degree problems for modular machines

DOI10.2307/2273419zbMath0474.03019OpenAlexW2110540690MaRDI QIDQ3929725

Daniel E. Cohen

Publication date: 1980

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2273419

zbMATH Keywords

halting problemrecursively enumerable degreesmany-one degreeconfluence problemdegrees of Turing machine problemssemi-infinite tapesimulations of Turing machinesspecial word problem

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Turing machines and related notions (03D10)

Related Items (1)

A FINITELY PRESENTED GROUP WITH ALMOST SOLVABLE CONJUGACY PROBLEM

Cites Work

• Unnamed Item
• Representation of Turing reducibility by word and conjugacy problems in finitely presented groups
• A New General Approach to the Theory of the Many‐One Equivalence of Decision Problems for Algorithmic Systems
• Machine Configuration and Word Problems of Given Degree of Unsolvability

This page was built for publication: Degree problems for modular machines