1054 search results - page 54 / 211 » A Formalization of the Turing Test |
113
click to vote
STACS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We give a characterization, in terms of computational complexity, of the family Rec1 of the unary picture languages that are tiling recognizable. We introduce quasi-unary...
155
click to vote
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
The paper presents how the Random PROLOG Processor (RPP), a bio-inspired model of computations, can be used for formalization and analysis of a phenomenon - the Collective Intelli...
123
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...
135
click to vote
AI
1998
Springer
15 years 4 months ago
1998
Springer
In this paper, we propose a definition of goal achievability: given a basic action theory describing an initial state of the world and some primitive actions available to a robot...
118
click to vote
RP
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. In this paper we consider ν-MSR, a formalism that combines the two main existing approaches for multiset rewriting, namely MSR and CMRS. In ν-MSR we rewrite multisets o...