Q4585068 (Q4585068): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Ramsey methods in analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: General topology. I. Basic concepts and constructions. Dimension theory. Transl. from the Russian by D. B. O'Shea / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive characterization of computable real-valued functions and relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable invariance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779146 / 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: 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: Q4103527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Levels of discontinuity, limit-computability, and jump operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Randomness and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4316881 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real functions and numbers defined by Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4885914 / 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: Limiting recursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Is the Mandelbrot set computable? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond recursive real functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relatively recursive reals and real functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genericity of weakly computable objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Proofs of Some Theorems on High Degrees of Unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4323294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective genericity and differentiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3226755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separation Theorem for ∑ 1 1 Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5322161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recursive function, defined on a compact interval and having a continuous derivative that is not recursive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3611832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical recursion theory. The theory of functions and sets of natural numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the topological aspects of the theory of represented spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descriptive Set Theory in the Category of Represented Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-deterministic computation and the Jayne-Rogers Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended admissibility. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5529982 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On degrees of unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing Computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On degrees of recursive unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetische Operatoren / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetische und Bairesche Operatoren / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Arithmetical Hierarchy of Real Numbers / 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 13:59, 16 July 2024

scientific article; zbMATH DE number 6932682
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 6932682

    Statements

    0 references
    6 September 2018
    0 references
    0 references
    computable analysis
    0 references
    limit computability
    0 references
    computability relative to the halting problem
    0 references
    lowness
    0 references
    1-genericity
    0 references
    represented spaces
    0 references
    Galois connections
    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
    0 references
    0 references