2 search results - page 1 / 1 » Computably Enumerable Sets in the Solovay and the Strong Wea... |
CIE
2005
Springer
13 years 10 months ago
2005
Springer
The strong weak truth table reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occ...
APAL
2010
13 years 5 months ago
2010
The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both t...