m-reducibility with upper and lower bounds for reducing functions

DOI10.1023/A:1010257414757zbMATH Open1027.03035OpenAlexW157090682MaRDI QIDQ1566445FDOQ1566445

Authors: V. N. Belyaev, V. K. Bulitko 

Publication date: 15 June 2003

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1010257414757

Recommendations

• On bounded \(m\)-reducibilities
• scientific article; zbMATH DE number 4012595
• A generic m-reducibility
• BOUNDS IN THE TURING REDUCIBILITY OF FUNCTIONS
• scientific article; zbMATH DE number 3863189
• Reducibility by means of almost polynomial functions
• The M-Relative Reduct Problem
• scientific article; zbMATH DE number 3902637
• On reducibility of partial recursive functions

zbMATH Keywords

transitivitybranchingreflexivitybinary relationsrecursive functionsrecursive setsdegrees of undecidabilitybounded \(m\)-reducibilitytotal arithmetic functions

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Cited In (5)

• Sub-Turing reducibilities of restricted complexity
• Title not available (Why is that?)
• BOOLEAN CLASSES OF TURING REDUCTIONS
• On bounded \(m\)-reducibilities
• Title not available (Why is that?)

This page was built for publication: \(m\)-reducibility with upper and lower bounds for reducing functions

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