Post's problem for supertasks has both positive and negative solutions

DOI10.1007/s001530100112zbMath1024.03043arXivmath/9808128MaRDI QIDQ1407554

D. Massart

Publication date: 16 September 2003

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9808128

zbMATH Keywords

oracles; Post's problem; infinite time Turing machine; semi-decidable supertask degrees; supertask jump; transfinite-injury construction

Mathematics Subject Classification ID

03D30: Other degrees and reducibilities in computability and recursion theory

03D10: Turing machines and related notions

03D60: Computability and recursion theory on ordinals, admissible sets, etc.