203 search results - page 31 / 41 » Some thoughts on hypercomputation |
COCO
2009
Springer
14 years 2 months ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
The identification of mechanisms by which constraints on phenotypic variability are tuned in nature, and the implementation of these mechanisms in Evolutionary Algorithms (EAs) ca...
CHARME
2001
Springer
14 years 4 days ago
2001
Springer
Formal analysis remains outside the mainstream of system design practice. Interactive methods and tools are regarded by some to be on the margin of useful research in this area. Al...
CONTEXT
2001
Springer
14 years 4 days ago
2001
Springer
Abstract. This paper is devoted to discuss a general tendency in contextualism which is known as "radical contextualism". In the first part I state the well known paradox...