Computability of Real Numbers (Q5024567): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-59234-9_1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3166372913 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differences of halting probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on the Differences of Computably Enumerable Reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively enumerable reals and Chaitin \(\Omega\) numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theory of Program Size Formally Identical to Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of d. c. e. reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Randomness and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness, Computability, and Density / rank
 
Normal rank
Property / cites work
 
Property / cites work: Presentations of computably enumerable reals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5619076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5619077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the definitions of computable real continuous functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Level sets of univalent functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a Solution of Feigenbaum's Functional Equation in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the definitions of some complexity classes of real numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3966120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness and Recursive Enumerability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability and complexity. Essays dedicated to Rodney G. Downey on the occasion of his 60th birthday / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3765758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Criteria of constructibility for real numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Bloch-Landau Constant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative randomness and real closed fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3518437 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computable approximations of Landau's constant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective Riemann mappings of multiply connected domains and Riemann surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Computational Paradigms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of Turing degrees of divergence bounded computable real numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4551395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Real Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursion Theory and Dedekind Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3819052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nicht konstruktiv beweisbare Sätze der Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Computable Numbers, with an Application to the Entscheidungsproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Divergence Bounded Computable Real Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Turing Degrees of Weakly Computable Real Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of computably approximable real numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Divergence bounded computable real numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak computability and representation of reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure properties of real number classes under CBV functions / rank
 
Normal rank

Latest revision as of 20:06, 27 July 2024

scientific article; zbMATH DE number 7464639
Language Label Description Also known as
English
Computability of Real Numbers
scientific article; zbMATH DE number 7464639

    Statements

    Computability of Real Numbers (English)
    0 references
    0 references
    0 references
    26 January 2022
    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