Infinite time Turing machines and an application to the hierarchy of equivalence relations on the reals

zbMath1329.03075arXiv1101.1864MaRDI QIDQ3464656

Joel David Hamkins, Samuel Coskey

Publication date: 27 January 2016

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

zbMATH Keywords

infinite-time Turing machinesinfinite-time reducibility

Mathematics Subject Classification ID

Descriptive set theory (03E15) Complexity of computation (including implicit computational complexity) (03D15) Other degrees and reducibilities in computability and recursion theory (03D30) Computable structure theory, computable model theory (03C57) Turing machines and related notions (03D10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

This page was built for publication: Infinite time Turing machines and an application to the hierarchy of equivalence relations on the reals