Advertisement
Published in:
2003 | OriginalPaper | Chapter
Quasi-Degrees of Recursively Enumerable Sets
Author : Roland Sh. Omanadze
Published in: Computability and Models
Publisher: Springer US
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
The basis of the modern theory of degrees of unsolvability is established in the article by Post [46] in which the notions of many-one (m-) reducibility, truth-table (tt-), bounded truth-table (btt-) and Turing (T-) reducibility are introduced.