On Some Complexity Characteristics of Immune Sets

DOI10.1002/MALQ.19950410303MaRDI QIDQ4844506zbMATH OpenOpenAlexFDO

Authors V. K. Bulitko

Publication date 27 August 1995

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

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

zbMATH Keywords

complete setcompleteness criterionhyperhypersimple sethypersimple setKolmogorov complexitymaximal setssimple sets

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursively (computably) enumerable sets and degrees (03D25)

Recommendations

• scientific article; zbMATH DE number 3859105
• Bi-immune sets for complexity classes
• scientific article; zbMATH DE number 4004170
• Immunity and simplicity in relativizations of probabilistic complexity classes
• Immunity, Relativizations, and Nondeterminism

Cited in

(4)

• On the degrees of constructively immune sets
• scientific article; zbMATH DE number 3859105 (Why is no real title available?)
• Nonlevelable sets and immune sets in the accepting density hierarchy inNP
• Immunity and hyperimmunity for sets of minimal indices

This page was built for publication: On Some Complexity Characteristics of Immune Sets

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