Theoretical Computer Science: Computability, ...
Type de document :
Partie d'ouvrage
Titre :
Theoretical Computer Science: Computability, Decidability and Logic
Auteur(s) :
Bournez, Olivier [Auteur]
Laboratoire d'informatique de l'École polytechnique [Palaiseau] [LIX]
Dowek, Gilles [Auteur]
Deduction modulo, interopérabilité et démonstration automatique [DEDUCTEAM]
Gilleron, Remi [Auteur]
Machine Learning in Information Networks [MAGNET]
Grigorieff, Serge [Auteur]
Institut de Recherche en Informatique Fondamentale [IRIF (UMR_8243)]
Marion, Jean-Yves [Auteur]
Carbone [CARBONE]
Perdrix, Simon [Auteur]
Designing the Future of Computational Models [MOCQUA]
TISON, SOPHIE [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Laboratoire d'informatique de l'École polytechnique [Palaiseau] [LIX]
Dowek, Gilles [Auteur]
Deduction modulo, interopérabilité et démonstration automatique [DEDUCTEAM]
Gilleron, Remi [Auteur]
Machine Learning in Information Networks [MAGNET]
Grigorieff, Serge [Auteur]
Institut de Recherche en Informatique Fondamentale [IRIF (UMR_8243)]
Marion, Jean-Yves [Auteur]
Carbone [CARBONE]
Perdrix, Simon [Auteur]
Designing the Future of Computational Models [MOCQUA]
TISON, SOPHIE [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Titre de l’ouvrage :
A Guided Tour of Artificial Intelligence Research - Volume III: Interfaces and Applications of Artificial Intelligence (10.1007/978-3-030-06170-8)
Éditeur :
Springer International Publishing
Lieu de publication :
Cham
Date de publication :
2020
Discipline(s) HAL :
Informatique [cs]
Résumé en anglais : [en]
This chapter deals with a question in the very core of IA: what can be computed by a machine? An agreement has been reached on the answer brought by Alan Turing in 1936. Indeed, all other proposed approaches have led to ...
Lire la suite >This chapter deals with a question in the very core of IA: what can be computed by a machine? An agreement has been reached on the answer brought by Alan Turing in 1936. Indeed, all other proposed approaches have led to exactly the same answer. Thus, there is a mathematical model of what can be done by a machine. And this has allowed to prove surprising results which feed the reflection on intelligence and machines.Lire moins >
Lire la suite >This chapter deals with a question in the very core of IA: what can be computed by a machine? An agreement has been reached on the answer brought by Alan Turing in 1936. Indeed, all other proposed approaches have led to exactly the same answer. Thus, there is a mathematical model of what can be done by a machine. And this has allowed to prove surprising results which feed the reflection on intelligence and machines.Lire moins >
Langue :
Anglais
Audience :
Internationale
Vulgarisation :
Non
Collections :
Source :