Theoretical Computer Science: Computability, Decidability and Logic - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2020

Theoretical Computer Science: Computability, Decidability and Logic

Résumé

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.
Fichier non déposé

Dates et versions

hal-03173193 , version 1 (18-03-2021)

Identifiants

Citer

Olivier Bournez, Gilles Dowek, Rémi Gilleron, Serge Grigorieff, Jean-Yves Marion, et al.. Theoretical Computer Science: Computability, Decidability and Logic. A Guided Tour of Artificial Intelligence Research - Volume III: Interfaces and Applications of Artificial Intelligence (10.1007/978-3-030-06170-8), Springer International Publishing, pp.1-50, 2020, ⟨10.1007/978-3-030-06170-8_1⟩. ⟨hal-03173193⟩
188 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More