Degrees of unsolvability associated with Markov algorithms

DOI10.1007/BF00987253zbMATH Open0298.02040MaRDI QIDQ4052103FDOQ4052103

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

• Title not available (Why is that?)
• Recursively enumerable sets of positive integers and their decision problems
• Machine Configuration and Word Problems of Given Degree of Unsolvability
• Word problems and recursively enumerable degrees at unsolvability. A first paper on Thue systems
• The many-one equivalence of some general combinatorial decision problems
• Title not available (Why is that?)
• The equivalence of some general combinatorial decision problems
• Quantificational variants on the halting problem for turing machines
• Title not available (Why is that?)

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)