Sciweavers

3 search results - page 1 / 1
» Non-branching degrees in the Medvedev lattice of Pi01 classe...
Sort
View
AML
2006
83views more  AML 2006»
13 years 5 months ago
The Medvedev lattice of computably closed sets
Simpson introduced the lattice P of 0 1 classes under Medvedev reducibility. Questions regarding completeness in P are related to questions about measure and randomness. We presen...
Sebastiaan Terwijn
CCA
2009
Springer
13 years 11 months ago
Weihrauch Degrees, Omniscience Principles and Weak Computability
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 ...
Vasco Brattka, Guido Gherardi