Index sets in computable analysis

Authors
Cenzer, D Remmel, JB
Citation
D. Cenzer et Jb. Remmel, Index sets in computable analysis, THEOR COMP, 219(1-2), 1999, pp. 111-150
Citations number
31
Categorie Soggetti
Computer Science & Engineering
Journal title
THEORETICAL COMPUTER SCIENCE
ISSN journal
03043975 → ACNP
Volume
219
Issue
1-2
Year of publication
1999
Pages
111 - 150
Database
ISI
SICI code
0304-3975(19990528)219:1-2<111:ISICA>2.0.ZU;2-W
Abstract
Pi(1)(0) classes in a space X where X equals {0, 1}(omega), omega(omega), [ 0,1], or the real line R are given an effective enumeration P-e,P-x and the computably continuous functions are given an effective enumeration F-e,F-x . The notion of index sets associated with Pi(1)(0) classes and with comput ably continuous functions is developed. The complexity of various problems of analysis is determined by the complexity of the associated index set. (C ) 1999 Elsevier Science B.V. All rights reserved.