On Genericity and Ershov's Hierarchy
From MaRDI portal
Publication:2720321
DOI<161::AID-MALQ161>3.0.CO;2-E 10.1002/1521-3870(200105)47:2<161::AID-MALQ161>3.0.CO;2-EzbMath0991.03043OpenAlexW1974838334MaRDI QIDQ2720321
Publication date: 3 September 2002
Full work available at URL: https://doi.org/10.1002/1521-3870(200105)47:2<161::aid-malq161>3.0.co;2-e
stringsdensity functionsdifference hierarchycomputably enumerable setsErshov hierarchy\(\Delta_2\) sets1-generic sets
Complexity of computation (including implicit computational complexity) (03D15) Recursively (computably) enumerable sets and degrees (03D25)
Related Items (2)
Parsimony hierarchies for inductive inference ⋮ Multiple genericity: a new transfinite hierarchy of genericity notions
This page was built for publication: On Genericity and Ershov's Hierarchy