Degrees of unsolvability associated with Markov algorithms

DOI10.1007/BF00987253MaRDI QIDQ4052103zbMATH OpenFDO

Authors Charles E. Hughes

Publication date 1972

Published in International Journal of Computer & Information Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Thue and Post systems, etc. (03D03) Algorithms in computer science (68W99) Turing machines and related notions (03D10) Other degrees and reducibilities in computability and recursion theory (03D30) Word problems, etc. in computability and recursion theory (03D40)

Cites work

• scientific article; zbMATH DE number 3267349 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3371593 (Why is no real title available?)
• Machine Configuration and Word Problems of Given Degree of Unsolvability
• Quantificational variants on the halting problem for turing machines
• Recursively enumerable sets of positive integers and their decision problems
• The equivalence of some general combinatorial decision problems
• The many-one equivalence of some general combinatorial decision problems
• Word problems and recursively enumerable degrees at unsolvability. A first paper on Thue systems

Cited in

(3)

• Diem-Grade Logischer Entscheidungsprobleme
• Combinatorial systems defined over one- and two-letter alphabets
• Many-one degrees associated with semi-Thue systems

This page was built for publication: Degrees of unsolvability associated with Markov algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4052103)