Publications
Talk · Asian Logic Conference · October 1, 2006
COMPUTABLE NUMBERINGS IN THE HIERARCHY OF ERSHOV
S. A. Badaev, Zh. T. Talasbaeva
Computability, Logic, AI AlgorithmsAdvanced Topology and Set Theorysemigroups and automata theorycomputable numberingsErshov hierarchycomputably enumerable sets
More by Anuar Aimoldin
- Detecting a Shift Is Not Enough: Exact Minimax Limits of Linear Representation RepairarXiv · 2026
- Identifying Neural Source Dynamics from Unknown Local InterventionsarXiv · 2026
- PhysioTRACE: Provenance-Aware Stress Tests for Physiological Foundation ModelsarXiv · 2026
- Measurement-Gated Provenance Attenuation for Frozen EEG RepresentationsarXiv · 2026