Sciweavers

LFCS
1992
Springer
14 years 4 months ago
Banishing Robust Turing Completeness
This paper proves that "promise classes" are so fragilely structured that they do not robustly (i.e. with respect to all oracles) possess Turinghard sets even in classes...
Lane A. Hemachandra, Sanjay Jain, Nikolai K. Veres...