Effectively closed sets and graphs of computable real functions. (Q1607292): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability on subsets of Euclidean space. I: Closed and compact subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4764101 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934277 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively presented games and strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Index sets for \(\Pi^0_1\) classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Index sets in computable analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\omega\)-computations on Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of maximization and integration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable functionals / 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: Q4146722 / 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: Degrees of members of \(\Pi_ 1^ 0\) classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchies of number-theoretic predicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computability of fractal dimensions and Hausdorff measure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of real functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3227568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3248017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision problems forω-automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperarithmetical Index Sets in Recursion Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4749832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3778751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical recursion theory. Vol. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3819052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3030812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485693 / rank
 
Normal rank

Latest revision as of 12:17, 4 June 2024

scientific article
Language Label Description Also known as
English
Effectively closed sets and graphs of computable real functions.
scientific article

    Statements

    Effectively closed sets and graphs of computable real functions. (English)
    0 references
    0 references
    0 references
    31 July 2002
    0 references
    0 references
    Computable analysis
    0 references