Infinite computations with random oracles

DOI10.1215/00294527-3832619zbMath1417.03243arXiv1307.0160OpenAlexW2166732718MaRDI QIDQ2364653

Philipp Schlicht, Merlin Carl

Publication date: 21 July 2017

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

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

zbMATH Keywords

constructibilityrandomnessadmissible setsgeneralized recursion theoryinfinitary computations

Mathematics Subject Classification ID

Descriptive set theory (03E15) Consistency and independence results (03E35) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Higher-type and set recursion theory (03D65) Algorithmic randomness and dimension (03D32)

Related Items (5)

$$ITRM$$-Recognizability from Random Oracles ⋮ RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY ⋮ On slow minimal reals I ⋮ Recognizable sets and Woodin cardinals: computation beyond the constructible universe ⋮ GENERICITY AND RANDOMNESS WITH ITTMS

This page was built for publication: Infinite computations with random oracles