RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY
From MaRDI portal
Publication:4579818
Recommendations
- Randomness via effective descriptive set theory
- Descriptive set theoretical complexity of randomness notions
- scientific article; zbMATH DE number 1531917
- Random reals and possibly infinite computations Part I: Randomness in ∅′
- Structure and Randomness in Computability and Set Theory
- Effective randomness for computable probability measures
- Randomness below complete theories of arithmetic
- scientific article; zbMATH DE number 2204767
- Randomness extraction in computability theory
- Computable Measure Theory and Algorithmic Randomness
Cites work
- Algorithmic randomness and complexity.
- Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems
- Computability and randomness
- Continuous higher randomness
- Descriptive set theoretical complexity of randomness notions
- Forcing absoluteness and regularity properties
- Higher randomness and forcing with closed sets
- scientific article; zbMATH DE number 194101 (Why is no real title available?)
- scientific article; zbMATH DE number 3494394 (Why is no real title available?)
- scientific article; zbMATH DE number 787541 (Why is no real title available?)
- Hypermachines
- Infinite computations with random oracles
- Infinite time recognizability from generic oracles and the recognizable jump operator
- Infinite time Turing machines
- Logical Approaches to Computational Barriers
- Measure and category in effective descriptive set theory
- On the Reals Which Cannot Be Random
- Randomness and degree theory for infinite time register machines
- Randomness in the higher setting
- Randomness via effective descriptive set theory
- Recognizable sets and Woodin cardinals: computation beyond the constructible universe
- Recursion theory. Computational aspects of definability
- Set Theory
- The basic theory of infinite time register machines
- The descriptive set theory of the Lebesgue density theorem
- The higher infinite. Large cardinals in set theory from their beginnings.
- The Length of Infinite Time Turing Machine Computations
- Tree representations via ordinal machines
Cited in
(18)- The recognizability strength of infinite time Turing machines with ordinal parameters
- Infinite computations with random oracles
- Measure-theoretic uniformity and the Suslin functional
- Higher randomness and lim-sup forcing within and beyond hyperarithmetic
- Algorithmic randomness for infinite time register machines
- Genericity and randomness with ITTMs
- Randomness via effective descriptive set theory
- Random reals and possibly infinite computations Part I: Randomness in ∅′
- Randomness and degree theory for infinite time register machines
- Randomness via infinite computation and effective descriptive set theory
- On the Weihrauch degree of the additive Ramsey theorem
- Hilbert's tenth problem for term algebras with a substitution operator
- Complemented subsets and Boolean-valued, partial functions
- Defining long words succinctly in FO and MSO
- On the first-order parts of problems in the Weihrauch degrees
- Algorithmically random series
- Ideal presentations and numberings of some classes of effective quasi-Polish spaces
- Lower bounds on () and other properties of -register machines
This page was built for publication: RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4579818)
