5 search results - page 1 / 1 » Banishing Robust Turing Completeness |
LFCS
1992
Springer
13 years 8 months ago
1992
Springer
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...
COCO
2004
Springer
13 years 10 months ago
2004
Springer
We study the robustness of complete sets for various complexity classes. A complete set A is robust if for any f(n)-dense set S ∈ P, A−S is still complete, where f(n) ranges f...
MFCS
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. In this paper we discuss the computational power of Lipschitz dynamical systems which are robust to infinitesimal perturbations. Whereas the study in [1] was done only f...
CCS
2009
ACM
13 years 8 months ago
2009
ACM
Code injections attacks are one of the most powerful and important classes of attacks on software. In such attacks, the attacker sends malicious input to a software application, w...
ISTCS
1993
Springer
13 years 8 months ago
1993
Springer
We pursue a particular approach to analog computation, based on dynamical systems of the type used in neural networks research. Our systems have a xed structure, invariant in time...