Infinite time recognizability from generic oracles and the recognizable jump operator1
From MaRDI portal
Publication:4593494
DOI10.3233/COM-160061zbMath1423.03154arXiv1508.06493OpenAlexW2963998279MaRDI QIDQ4593494
Publication date: 22 November 2017
Published in: Computability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.06493
Descriptive set theory (03E15) Consistency and independence results (03E35) Turing machines and related notions (03D10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Higher-type and set recursion theory (03D65)
Related Items
RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY ⋮ Koepke machines and satisfiability for infinitary propositional languages