Comparing C.E. Sets Based on Their Settling Times

DOI10.1007/978-3-540-73001-9_21zbMATH Open1151.03332OpenAlexW1531820710MaRDI QIDQ5425321FDOQ5425321

Barbara Csima

Publication date: 13 November 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73001-9_21

zbMATH Keywords

survey

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

This page was built for publication: Comparing C.E. Sets Based on Their Settling Times

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