Towards Computational Models of Artificial Cognitive Systems That Can, in Principle, Pass the Turing Test

0368232 - ÚI 2012 RIV DE eng C - Conference Paper (international conference)
Wiedermann, Jiří
Towards Computational Models of Artificial Cognitive Systems That Can, in Principle, Pass the Turing Test.
SOFSEM 2012. Theory and Practice of Computer Science. Berlin: Springer, 2012 - (Bieliková, M.; Friedrich, G.; Gottlob, G.; Katzenbeisser, S.; Turán, G.), s. 44-63. Lecture Notes in Computer Science, 7147. ISBN 978-3-642-27659-0. ISSN 0302-9743.
[SOFSEM 2012. Conference on Current Trends in Theory and Practice of Computer Science /38./. Špindlerův Mlýn (CZ), 21.01.2012-27.01.2012]
R&D Projects: GA ČR GAP202/10/1333
Institutional research plan: CEZ:AV0Z10300504
Keywords : cognitive systems * Turing test * high-level architecture of an artificial agent
Subject RIV: IN - Informatics, Computer Science

We will give plausible arguments in favor of a claim that we already have sufficient knowledge to understand the working of interesting artificial minds attaining a high-level cognition, consciousness included. Achieving a higher-level AI seems to be not a matter of a fundamental scientific breakthrough but rather a matter of exploiting our best theories of artificial minds and our most advanced data processing technologies. We list the theories we have in mind and illustrate their role and place on the example of a high-level architecture of a conscious cognitive agent with a potential to pass the Turing test.
Permanent Link: http://hdl.handle.net/11104/0202630