On Some Complexity Characteristics of Immune Sets
From MaRDI portal
Publication:4844506
DOI10.1002/MALQ.19950410303zbMath0827.03024OpenAlexW2089777076MaRDI QIDQ4844506
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
Kolmogorov complexitycomplete setcompleteness criterionhyperhypersimple setsimple setsmaximal setshypersimple set
Complexity of computation (including implicit computational complexity) (03D15) Recursively (computably) enumerable sets and degrees (03D25)
This page was built for publication: On Some Complexity Characteristics of Immune Sets