Probabilistic computability and choice (Q2346414): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1312.7305 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4256640 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long cycles in vertex-transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measure and integration theory. Transl. from the German by Robert B. Burckel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3415147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notions of Probabilistic Computability on Represented Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3518440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable invariance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective Borel measurability and reducibility of functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closed choice and a uniform low basis theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective Choice and Boundedness Principles in Computable Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weihrauch degrees, omniscience principles and weak computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5150974 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability on subsets of metric spaces. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniform relationships between combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Randomness and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable de Finetti measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform test of algorithmic randomness over a general space / rank
 
Normal rank
Property / cites work
 
Property / cites work: How incomputable is the separable Hahn-Banach theorem? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological complexity with continuous operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random elements in effective topological spaces with measure. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The degree structure of Weihrauch-reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of probability measures and Martin-Löf randomness over metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: ∏ 0 1 Classes and Degrees of Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4323294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closed Choice for Finite and for Convex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of unsolvability of continuous functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3611832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3075220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the (semi)lattices induced by continuous reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations of measurable sets in computable measure theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of Unsolvability. (AM-55) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity on computable metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real hypercomputation and continuity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revising Type-2 Computation and Degrees of Discontinuity / rank
 
Normal rank

Latest revision as of 03:33, 10 July 2024

scientific article
Language Label Description Also known as
English
Probabilistic computability and choice
scientific article

    Statements

    Probabilistic computability and choice (English)
    0 references
    0 references
    0 references
    0 references
    1 June 2015
    0 references
    computable analysis
    0 references
    Weihrauch lattice
    0 references
    computability theory
    0 references
    reverse mathematics
    0 references
    randomized algorithms
    0 references
    randomized computations on infinite objects
    0 references
    probabilistic Turing machine
    0 references
    Las Vegas computable functions
    0 references
    weak weak König's lemma
    0 references
    0 references
    0 references
    0 references
    0 references
    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
    0 references