GENERICITY AND RANDOMNESS WITH ITTMS

DOI10.1017/jsl.2019.62zbMath1451.03025OpenAlexW2973029131WikidataQ127283561 ScholiaQ127283561MaRDI QIDQ5207572

Paul-Elliot Anglès d'Auriac, Benoit Monin

Publication date: 10 January 2020

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

Full work available at URL: https://doi.org/10.1017/jsl.2019.62

zbMATH Keywords

forcingalgorithmic randomnesshigher computabilityconstructiblesITTM

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lowness of higher randomness notions
• Infinite computations with random oracles
• Infinite Time Turing Machines With Only One Tape
• RANDOMNESS IN THE HIGHER SETTING
• Higher randomness and forcing with closed sets
• Algorithmic Randomness and Complexity
• Notions of weak genericity
• The Length of Infinite Time Turing Machine Computations
• Infinite time Turing machines
• RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY
• HIGHER RANDOMNESS AND GENERICITY
• Continuous higher randomness
• Admissible Sets and Structures
• Randomness via effective descriptive set theory
• The definition of random sequences

This page was built for publication: GENERICITY AND RANDOMNESS WITH ITTMS