scientific article
From MaRDI portal
Publication:3545568
zbMath1164.03341MaRDI QIDQ3545568
A. N. Degtev, Maksim L'yudovich Platonov
Publication date: 11 December 2008
Full work available at URL: https://eudml.org/doc/55576
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
reducibilitypartial recursive functionrecursively enumerable setcomputable numbering\(p\)-reducibility
Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Theory of numerations, effectively presented structures (03D45)
Related Items (2)
On \(p \)-universal and \(p \)-minimal numberings ⋮ Enumeration reducibility and positive reducibility of the numberings of families of arithmetic sets
This page was built for publication:
