• English
    • français
  • Help
  •  | 
  • Contact
  •  | 
  • About
  •  | 
  • Login
  • HAL portal
  •  | 
  • Pages Pro
  • EN
  •  / 
  • FR
View Item 
  •   LillOA Home
  • Liste des unités
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
  • View Item
  •   LillOA Home
  • Liste des unités
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Theoretical Computer Science: Computability, ...
  • BibTeX
  • CSV
  • Excel
  • RIS

Document type :
Partie d'ouvrage
DOI :
10.1007/978-3-030-06170-8_1
Title :
Theoretical Computer Science: Computability, Decidability and Logic
Author(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, Rémi [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] refId
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Book title :
A Guided Tour of Artificial Intelligence Research - Volume III: Interfaces and Applications of Artificial Intelligence (10.1007/978-3-030-06170-8)
Publisher :
Springer International Publishing
Publication place :
Cham
Publication date :
2020
HAL domain(s) :
Informatique [cs]
English abstract : [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 ...
Show more >
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.Show less >
Language :
Anglais
Audience :
Internationale
Popular science :
Non
Collections :
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
Source :
Harvested from HAL
Université de Lille

Mentions légales
Université de Lille © 2017