RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY

DOI10.1017/jsl.2018.3OpenAlexW2963554245WikidataQ129478446 ScholiaQ129478446MaRDI QIDQ4579818

Merlin Carl, Philipp Schlicht

Publication date: 10 August 2018

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

effective descriptive set theoryinfinite time Turing machinealgorithmic randomne

Mathematics Subject Classification ID

Descriptive set theory (03E15) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Algorithmic randomness and dimension (03D32)

Related Items (3)

The recognizability strength of infinite time Turing machines with ordinal parameters ⋮ GENERICITY AND RANDOMNESS WITH ITTMS ⋮ Measure-theoretic uniformity and the Suslin functional

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Forcing absoluteness and regularity properties
• Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems
• Recognizable sets and Woodin cardinals: computation beyond the constructible universe
• The descriptive set theory of the Lebesgue density theorem
• Recursion theory. Computational aspects of definability
• The basic theory of infinite time register machines
• Infinite computations with random oracles
• RANDOMNESS IN THE HIGHER SETTING
• Higher randomness and forcing with closed sets
• On the Reals Which Cannot Be Random
• Hypermachines
• Descriptive set theoretical complexity of randomness notions
• Algorithmic Randomness and Complexity
• Measure and category in effective descriptive set theory
• The Length of Infinite Time Turing Machine Computations
• Infinite time Turing machines
• Infinite time recognizability from generic oracles and the recognizable jump operator1
• Set Theory
• Tree Representations via Ordinal Machines
• Continuous higher randomness
• Randomness via effective descriptive set theory
• Randomness and degree theory for infinite time register machines1
• Logical Approaches to Computational Barriers

This page was built for publication: RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY