Skip Navigation

Journal of Logic and Computation 1992 2(3):375-395; doi:10.1093/logcom/2.3.375
© 1992 by Oxford University Press
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by CUCKER, F.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Original Articles

The Arithmetical Hierarchy Over the Reals

FELIPE CUCKER {dagger}

Departament de Llenguatges i Sistemes Informàtics, Universitat Politécnica de Catalunya Barcelona 08028, Spain

An usual classification of undecidable problems in computability theory is the one given by the arithmetical hierarchy introduced by Kleene. Very recently. L. Blum, M. Shub and S. Smale devised a model of computation able to work with real numbers and showed the main properties of a computability theory for that model. In this paper we introduce the arithmetical hierarchy for it. A syntactical characterization is given, together with some complete problems. Also, it is shown that if nondeterministic machines are considered instead of deterministic ones, a different set of classes is obtained (unlike the classical case) and all these classes are related with the classification of sets of reals done in descriptive set theory.

Keywords: Blum; Shub & Smale model of computation; recursion theory; hierarchies


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.