\(m\)-reducibility with upper and lower bounds for reducing functions

DOI10.1023/A:1010257414757zbMath1027.03035OpenAlexW157090682MaRDI QIDQ1566445

V. K. Bulitko, V. N. Belyaev

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

zbMATH Keywords

reflexivitytransitivityrecursive setsbranchingbinary relationsrecursive functionsdegrees of undecidabilitybounded \(m\)-reducibilitytotal arithmetic functions

Mathematics Subject Classification ID

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

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