Infinite time recognizability from generic oracles and the recognizable jump operator1

DOI10.3233/COM-160061zbMath1423.03154arXiv1508.06493MaRDI QIDQ4593494

Merlin Carl

Publication date: 22 November 2017

Published in: Computability (Search for Journal in Brave)

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

zbMATH Keywords

genericity; recognizability; ordinal computability; jump operator; infinite time Turing machine

Mathematics Subject Classification ID

03E15: Descriptive set theory

03E35: Consistency and independence results

03D10: Turing machines and related notions

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

03D65: Higher-type and set recursion theory