13 search results - page 1 / 3 » Undecidability in Weihrauch Degrees |
CIE
2010
Springer
13 years 5 months ago
2010
Springer
CCA
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
JC
2000
13 years 10 months ago
2000
The Turing degree of a real number x is defined as the Turing degree of its binary expansion. This definition is quite natural and robust. In this paper we discuss some basic degr...
CCA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can...
JCSS
2007
13 years 10 months ago
2007
We show that the elementary theory of the structure of the Solovay degrees of computably enumerable reals is undecidable.