Mitotic recursively enumerable sets
From MaRDI portal
Publication:4774029
Cites work
Cited in
(21)- A Completely Mitotic Nonrecursive R.E. Degree
- Structural interactions of the recursively enumerable T- and W-degrees
- Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree
- Some observations on mitotic sets
- Introduction to autoreducibility and mitoticity
- Completely mitotic r. e. degrees
- Autoreducibility, mitoticity, and immunity
- Completely mitotic c.e. degrees and non-jump inversion
- Non-cupping, measure and computably enumerable splittings
- The distribution of the generic recursively enumerable degrees
- Non-mitotic sets
- On the autoreducibility of functions
- Learning finite variants of single languages from informant
- Recursively enumerable sets and degrees
- Deficiency Sets and Bounded Information Reducibilities
- Splitting theorems and the jump operator
- Splitting theorems in recursion theory
- Space-efficient informational redundancy
- Non-mitotic Sets
- Classification of degree classes associated with r.e. subspaces
- Autoreducibility and mitoticity of logspace-complete sets for NP and other classes
This page was built for publication: Mitotic recursively enumerable sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4774029)