All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Towards Computational Models of Artificial Cognitive Systems that can, in Principle, Pass the Turing Test

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F12%3A00368232" target="_blank" >RIV/67985807:_____/12:00368232 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1007/978-3-642-27660-6_5" target="_blank" >http://dx.doi.org/10.1007/978-3-642-27660-6_5</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-642-27660-6_5" target="_blank" >10.1007/978-3-642-27660-6_5</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Towards Computational Models of Artificial Cognitive Systems that can, in Principle, Pass the Turing Test

  • Original language description

    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 nota 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 theexample of a high-level architecture of a conscious cognitive agent with a potential to pass the Turing test.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GAP202%2F10%2F1333" target="_blank" >GAP202/10/1333: NoSCoM: Non-Standard Computational Models and Their Applications in Complexity, Linguistics, and Learning</a><br>

  • Continuities

    Z - Vyzkumny zamer (s odkazem do CEZ)

Others

  • Publication year

    2012

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    SOFSEM 2012. Theory and Practice of Computer Science

  • ISBN

    978-3-642-27659-0

  • ISSN

  • e-ISSN

  • Number of pages

    20

  • Pages from-to

    44-63

  • Publisher name

    Springer

  • Place of publication

    Berlin

  • Event location

    Špindlerův Mlýn

  • Event date

    Jan 21, 2012

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article