1054 search results - page 26 / 211 » A Formalization of the Turing Test |
AAAI
1997
15 years 1 months ago
1997
In this paper we review the historical developmentof computerchess and discuss its impactonthe conceptof intelligence. Withthe adventof electronic computersafter the Second WorldW...
CORR
2002
Springer
14 years 11 months ago
2002
Springer
We introduce a general and in a certain sense time-optimal way of solving one problem after another, efficiently searching the space of programs that compute solution candidates, i...
103
click to vote
AI
2007
Springer
15 years 8 hour ago
2007
Springer
It is not surprising that reaching human-level AI has proved to be difficult and progress has been slow— though there has been important progress. The slowness and the demand t...
ESCIENCE
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper we present a general domain for the analysis of workflows and workflow components based on the notion of a collection of Turing machines sharing a set of tapes. We s...
ICCAD
2000
IEEE
15 years 4 months ago
2000
IEEE
computation and automatic abstraction. Second, Ketchum performs not only automatic test generation but also unreachability analysis, which enables the test generation effort to be ...