Effectively closed sets and graphs of computable real functions.
type: Item
instance of: scholarly article
title: Effectively closed sets and graphs of computable real functions.
zbMATH Open document ID: 1039.03033
DOI: 10.1016/S0304-3975(01)00069-X
author: Douglas Cenzer
author: Jeffrey Remmel
published in: Theoretical Computer Science
publication date: 2002-07-31T00:00:00Z
Mathematics Subject Classification ID: 03D45
zbMATH DE Number: 1774165
zbMATH Keywords: Computable analysis
MaRDI profile type: Publication
cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
cites work: Computability on subsets of Euclidean space. I: Closed and compact subsets
cites work: Q4764101
cites work: Q4934277
cites work: Recursively presented games and strategies
cites work: Index sets for \(\Pi^0_1\) classes
cites work: Q4249723
cites work: Index sets in computable analysis
cites work: \(\omega\)-computations on Turing machines
cites work: The computational complexity of maximization and integration
cites work: Computable functionals
cites work: On the definitions of computable real continuous functions
cites work: Q4146722
cites work: ∏ 0 1 Classes and Degrees of Theories
cites work: Degrees of members of \(\Pi_ 1^ 0\) classes
cites work: Hierarchies of number-theoretic predicates
cites work: Q4002474
cites work: On the computability of fractal dimensions and Hausdorff measure
cites work: Computational complexity of real functions
cites work: Q3227568
cites work: Q3248017
cites work: Decision problems forω-automata
cites work: Hyperarithmetical Index Sets in Recursion Theory
cites work: Q4749832
cites work: Q3778751
cites work: Classical recursion theory. Vol. II
cites work: Q3994907
cites work: Q3819052
cites work: Q3030812
cites work: Q4281565
cites work: Q3751553
cites work: Q4217582
cites work: Q4485693
full work available at URL: s0304-3975(01)00069-x
OpenAlex ID: W2053095990
description: scientific article; zbMATH DE number 1774165