Author:
Hamkins Joel David,Lewis Andy
Abstract
AbstractWe extend in a natural way the operation of Turing machines to infinite ordinal time, and investigate the resulting supertask theory of computability and decidability on the reals. Every set. for example, is decidable by such machines, and the semi-decidable sets form a portion of the sets. Our oracle concept leads to a notion of relative computability for sets of reals and a rich degree structure, stratified by two natural jump operators.
Publisher
Cambridge University Press (CUP)
Cited by
176 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Limitative computational explanations;Philosophical Studies;2023-10-08
2. ¿Existen las máquinas acelerantes de Turing?;TECHNO REVIEW. International Technology, Science and Society Review /Revista Internacional de Tecnología, Ciencia y Sociedad;2023-05-29
3. All Melodies Are Lost – Recognizability for Weak and Strong $$\alpha $$-Register Machines;Lecture Notes in Computer Science;2023
4. Symmetry for Transfinite Computability;Lecture Notes in Computer Science;2023
5. A Constructive Picture of Noetherian Conditions and Well Quasi-orders;Lecture Notes in Computer Science;2023