429 search results - page 56 / 86 » Turing computations on ordinals |
ITA
2006
14 years 9 months ago
2006
Abstract. We compare various computational complexity classes defined within the framework of membrane systems, a distributed parallel computing device which is inspired from the f...
111
click to vote
NC
2011
14 years 16 days ago
2011
In this paper we consider three variants of accepting networks of evolutionary processors. It is known that two of them are equivalent to Turing machines. We propose here a direct ...
CVPR
2004
IEEE
15 years 11 months ago
2004
IEEE
Abstract-- This paper describes two distortion estimation techniques for object recognition that solve EZ-Gimpy and Gimpy-r, two of the visual CAPTCHAs ("Completely Automated ...
AML
2010
14 years 9 months ago
2010
A Schnorr test relative to some oracle A may informally be called "universal" if it covers all Schnorr tests. Since no true universal Schnorr test exists, such an A cann...
MST
2008
14 years 9 months ago
2008
The Turing and many-one completeness notions for NP have been previously separated under measure, genericity, and bi-immunity hypotheses on NP. The proofs of all these results rel...