On reducibility of partial recursive functions

DOI10.1023/A:1004820220189MaRDI QIDQ5932612zbMATH OpenOpenAlexFDO

Authors A. N. Degtev, E. S. Sakunova

Publication date 10 June 2001

Published in Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/121084

zbMATH Keywords

partial recursive functionreducibility

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Other degrees and reducibilities in computability and recursion theory (03D30)

Review text

The authors introduce a special notion of reducibility for partial recursive functions along with some refinements and study their lattice-theoretic and elementary properties.

Cited in

(4)

• \(m\)-reducibility with upper and lower bounds for reducing functions
• Reductional programming of functions represented by recurrent relations of the first order
• scientific article; zbMATH DE number 4160710 (Why is no real title available?)
• scientific article; zbMATH DE number 3902638 (Why is no real title available?)

This page was built for publication: On reducibility of partial recursive functions

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