MECA SAPIENS - machine consciousness project

In this section we describe the Turing test, we explore the key assumption that underly this test of machine intelligence, we examine the links between the test and the black box concept, we formulate a chess-based version of the test, we look at the semantic and bandwidth requirements of the test.

In the standard version, the human evaluator knows that his interlocutor may be a machine. A weaker version, where the human does not suspect this is usually called blind Turing. We call it Trusting Turing because it exhibits non probing behavior and is linked to another situation: Knowing Turing. Trusting and knowing Turing provide us with a useful indicator of consciousness.

Turing tag is a variant of the Turing test modelled on speed dating. This variant allows us to provide a first basic definition of the Belief state of a conscious entity.

Turing Tag and Turing Fest lead us to the last and most important variation of the Turing test: Assisted Turing. Assisted Turing appears to be a more limited and simpler version of the Turing test. In fact it is more powerful and will be a componenet in the initial design layer (Layer 0) of the blueprint.

It is possible, with today’s technology, to develop a system capable of achieving the Turing test. The primary obstacle to the realization of this objective is not technical, it is financial. The PEDO-NAB project, proposed here, would justify a significant financial investment in applications that can pass the Turing Test.