BOUNDS IN THE TURING REDUCIBILITY OF FUNCTIONS

DOI10.1002/MALQ.19920380141zbMATH Open0798.03045OpenAlexW2160249549MaRDI QIDQ4295244FDOQ4295244

Karol Habart

Publication date: 3 November 1994

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19920380141

zbMATH Keywords

Turing reducibilityincompressibility of setsweak tt-reducibility

Mathematics Subject Classification ID

Hierarchies of computability and definability (03D55) Other degrees and reducibilities in computability and recursion theory (03D30)

Cited In (5)

• Title not available (Why is that?)
• Computable fields and the bounded Turing reduction
• Title not available (Why is that?)
• \(m\)-reducibility with upper and lower bounds for reducing functions
• Kobayashi compressibility

This page was built for publication: BOUNDS IN THE TURING REDUCIBILITY OF FUNCTIONS

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