1054 search results - page 11 / 211 » A Formalization of the Turing Test |
FUIN
2006
14 years 12 months ago
2006
Abstract. We introduce generalized trajectories where the individual symbols are interpreted as operations performed on the operand words. The various previously considered traject...
100
click to vote
JIPS
2010
14 years 6 months ago
2010
Test scenarios can be derived based on some system models for requirements validation purposes. Model-based test suite reduction aims to provide a smaller set of test scenarios whi...
FAC
2008
14 years 12 months ago
2008
This paper presents a formal model and a systematic approach to the validation of communication tures at a high level of abstraction. This model is described mathematically by a fu...
CORR
2006
Springer
14 years 12 months ago
2006
Springer
We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several furth...
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...