The Representation of Many-One Degrees by Decision Problems of Turing Machines

DOI10.1112/PLMS/S3-26.1.167zbMATH Open0253.02041OpenAlexW2022619892MaRDI QIDQ5666540FDOQ5666540

Authors: Ross A. Overbeek 

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

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Other degrees and reducibilities in computability and recursion theory (03D30) Computability and recursion theory (03D99) Word problems, etc. in computability and recursion theory (03D40)

Cited In (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

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