On the uniform computational content of computability theory (Q1694010): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Comparing DNR and WWKL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diagonally non-computable functions and fireworks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3803111 / 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: Borel Complexity of Topological Operations on Computable Metric Spaces / 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: Las Vegas Computability and Algorithmic Randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic computability and choice / 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: On the uniform computational content of computability theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological properties of real number representations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algebraic structure of Weihrauch degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability on subsets of metric spaces. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the strength of Ramsey's theorem for pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal degrees and the jump operator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4417312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniform relationships between combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPARING THE STRENGTH OF DIAGONALLY NONRECURSIVE FUNCTIONS IN THE ABSENCE OF INDUCTION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary subtrees with few labeled paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Randomness and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A criterion for completeness of degrees of unsolvability / 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: SEPARATING FRAGMENTS OF WLEM, LPO, AND MP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions / 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 the Radon-Nikodym Derivative / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cohesive set which is not high / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upward closure and cohesive degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diagonally Non-Computable Functions and Bi-Immunity / 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: The upper semi-lattice of degrees of recursive unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cohesive principle and the Bolzano-Weierstraß principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Strength of Weak Compactness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability and Randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical recursion theory. Vol. II / 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: Mass Problems and Measure-Theoretic Regularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of Unsolvability: A Tutorial / rank
 
Normal rank
Property / cites work
 
Property / cites work: The axiomatization of randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lowness for genericity / rank
 
Normal rank

Latest revision as of 00:54, 15 July 2024

scientific article
Language Label Description Also known as
English
On the uniform computational content of computability theory
scientific article

    Statements

    On the uniform computational content of computability theory (English)
    0 references
    0 references
    0 references
    0 references
    1 February 2018
    0 references
    computable analysis
    0 references
    Weihrauch lattice
    0 references
    computability 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
    0 references