The Representation of Many-One Degrees by Decision Problems of Turing Machines
From MaRDI portal
Publication:5666540
DOI10.1112/PLMS/S3-26.1.167zbMath0253.02041OpenAlexW2022619892MaRDI QIDQ5666540
Publication date: 1973
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/plms/s3-26.1.167
Word problems, etc. in computability and recursion theory (03D40) Other degrees and reducibilities in computability and recursion theory (03D30) Computability and recursion theory (03D99) Turing machines and related notions (03D10)
Related Items (2)
Diem-Grade Logischer Entscheidungsprobleme ⋮ Representation of one-one degrees by decision problems for system functions
This page was built for publication: The Representation of Many-One Degrees by Decision Problems of Turing Machines
