244 search results - page 19 / 49 » Turing machines and bimachines |
110
click to vote
AIM
2005
14 years 11 months ago
2005
If it is true that good problems produce good science, then it will be worthwhile to identify good problems, and even more worthwhile to discover the attributes that make them goo...
IJCAI
2007
15 years 1 months ago
2007
This goal of this paper is to defend the plausibility of the argument that passing the Turing test is a sufficient condition for the presence of intelligence. To this effect, we ...
115
click to vote
COLT
2008
Springer
15 years 1 months ago
2008
Springer
We show that randomly generated monotone c log(n)-DNF formula can be learned exactly in probabilistic polynomial time. Our notion of randomly generated is with respect to a unifor...
111
click to vote
UPP
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. This is just a glimpse to the fruitful and constant preoccupation of computer science to try to get inspired by biology, at various levels. Besides briefly discussing th...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
Most research into hypercomputation focuses only on machines able to prove stronger results the basic Turing Machine, hence the phrase hypercomputation. However, developing hyperco...