On the convergence of query-bounded computations and logical closure properties of c.e. sets

DOI10.2307/2694961zbMath1002.03036OpenAlexW2083324532MaRDI QIDQ4328820

Timothy H. McNicholl

Publication date: 7 January 2003

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2694961

zbMATH Keywords

Turing machinecomputably enumerable setsTuring reducible\(n\)-correctable sets

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Turing machines and related notions (03D10)

This page was built for publication: On the convergence of query-bounded computations and logical closure properties of c.e. sets