Representation of one-one degrees by decision problems for system functions

DOI10.1016/0022-0000(82)90033-2zbMath0507.03016OpenAlexW2134363103MaRDI QIDQ1837180

M. B. Thuraisingham

Publication date: 1982

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(82)90033-2

zbMATH Keywords

decision problemcombinatorial system

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Cites Work

• Unnamed Item
• Combinatorial systems. I: Cylindrical problems
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• SYSTEM FUNCTIONS AND THEIR DECISION PROBLEMS
• Machine Configuration and Word Problems of Given Degree of Unsolvability
• The Representation of Many-One Degrees by Decision Problems of Turing Machines
• Recursively enumerable sets of positive integers and their decision problems

This page was built for publication: Representation of one-one degrees by decision problems for system functions