RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY (Q4579818): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1017/jsl.2018.3 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963554245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The descriptive set theory of the Lebesgue density theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4075450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous higher randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4844091 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness and degree theory for infinite time register machines1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite time recognizability from generic oracles and the recognizable jump operator1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The basic theory of infinite time register machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite computations with random oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizable sets and Woodin cardinals: computation beyond the constructible universe / rank
 
Normal rank
Property / cites work
 
Property / cites work: RANDOMNESS IN THE HIGHER SETTING / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursion theory. Computational aspects of definability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Randomness and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypermachines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite time Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness via effective descriptive set theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forcing absoluteness and regularity properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3535899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measure and category in effective descriptive set theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Approaches to Computational Barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher randomness and forcing with closed sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3611832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree Representations via Ordinal Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Length of Infinite Time Turing Machine Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descriptive set theoretical complexity of randomness notions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Reals Which Cannot Be Random / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129478446 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1017/JSL.2018.3 / rank
 
Normal rank

Latest revision as of 14:45, 30 December 2024

scientific article; zbMATH DE number 6915724
Language Label Description Also known as
English
RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY
scientific article; zbMATH DE number 6915724

    Statements

    RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY (English)
    0 references
    0 references
    0 references
    10 August 2018
    0 references
    algorithmic randomne
    0 references
    infinite time Turing machine
    0 references
    effective descriptive set theory
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references