ON A QUESTION OF CSIMA ON COMPUTATION-TIME DOMINATION

DOI10.1142/9789814449274_0010MaRDI QIDQ5737991zbMATH OpenOpenAlexFDO

Authors Xia Hua, Jiang Liu, Guohua Wu

Publication date 31 May 2017

Published in Proceedings of the 12th Asian Logic Conference (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/9d105fe618a93488932111e99be47705f5f6487b

zbMATH Keywords

computably enumerable setsErshov hierarchysettling functionssettling-time reducibility

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Hierarchies of computability and definability (03D55)

This page was built for publication: ON A QUESTION OF CSIMA ON COMPUTATION-TIME DOMINATION

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