Number of the records: 1  

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

  1. SYS0368232
    LBL
      
    00990^^^^^2200181^^^450
    005
      
    20240103195934.9
    014
      
    $a 000307258500005 $2 WOS
    014
      
    $a 84856046662 $2 SCOPUS
    017
    7-
    $a 10.1007/978-3-642-27660-6_5 $2 DOI
    100
      
    $a 20110923d m y slo 03 ba
    101
    0-
    $a eng
    102
      
    $a DE
    200
    1-
    $a Towards Computational Models of Artificial Cognitive Systems That Can, in Principle, Pass the Turing Test
    215
      
    $a 20 s.
    300
      
    $a invited paper
    463
    -1
    $1 001 cav_un_epca*0364423 $1 010 $a 978-3-642-27659-0 $1 011 $a 0302-9743 $1 200 1 $a SOFSEM 2012. Theory and Practice of Computer Science $v S. 44-63 $1 210 $a Berlin $c Springer $d 2012 $1 225 $a Lecture Notes in Computer Science $v 7147 $1 702 $a Bieliková $b M. $4 340 $1 702 $a Friedrich $b G. $4 340 $1 702 $a Gottlob $b G. $4 340 $1 702 $a Katzenbeisser $b S. $4 340 $1 702 $a Turán $b G. $4 340
    610
    0-
    $a cognitive systems
    610
    0-
    $a Turing test
    610
    0-
    $a high-level architecture of an artificial agent
    700
    -1
    $3 cav_un_auth*0100858 $a Wiedermann $b Jiří $i Oddělení teoretické informatiky $j Department of Theoretical Computer Science $p UIVT-O $w Department of Machine Learning $4 070 $T Ústav informatiky AV ČR, v. v. i.
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.