Treffer: Solovay reducibility on D-c.e real numbers

Title:
Solovay reducibility on D-c.e real numbers
Authors:
RETTINGER, Robert, XIZHONG ZHENG
Source:
COCOON 2005 : computing and combinatorics (Kunming, 16-29 August 2005)Lecture notes in computer science. :359-368
Publisher Information:
Berlin: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 14 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Recherche opérationnelle et modèles formalisés de gestion, Operational research and scientific management, Flots dans les réseaux. Problèmes combinatoires, Flows in networks. Combinatorial problems, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Recherche information. Graphe, Information retrieval. Graph, Approche probabiliste, Probabilistic approach, Enfoque probabilista, Problème combinatoire, Combinatorial problem, Problema combinatorio, Réductibilité, Reducibility, Reductibilidad
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Theoretische Informatik II, FernUniversität Hagen, 58084 Hagen, Germany
Department of Computer Science, Jiangsu University, Zhenjiang 212013, China
Theoretische Informatik, BTU Cottbus, 03044 Cottbus, Germany
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=17096416
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems

Operational research. Management
Accession Number:
edscal.17096416
Database:
PASCAL Archive

Weitere Informationen

A c.e. real x is Solovay reducible to another c.e. real y if x can be approximated at least as efficiently as y by means of increasing computable sequences of rational numbers. The Solovay reducibility classifies elegantly the relative randomness of c.e. reals. Especially, the c.e. random reals are complete unter the Solovay reducibility for c.e. reals. In this paper we investigate an extension of the Solovay reducibility to the Δ02-reals and show that the c.e. random reals are complete under (extended) Solovay reducibility for d-c.e. reals too. Actually we show that only the d-c.e. reals can be Solovay reducible to an c.e. random real. Furthermore, we show that this fails for the class of divergence bounded computable reals which extends the class of d-c.e. reals properly. In addition, we show also that any d-c.e. random reals are either c.e. or co-c.e.