Theoretical Computer Science: Computability, Decidability and Logic

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.

Domaines

Informatique [cs]

Jean-Yves Marion : Connectez-vous pour contacter le contributeur

https://hal.science/hal-03173193

Soumis le : jeudi 18 mars 2021-12:04:29

Dernière modification le : jeudi 21 novembre 2024-10:30:02

Dates et versions

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

Identifiants

HAL Id : hal-03173193 , version 1
DOI : 10.1007/978-3-030-06170-8_1

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⟩

Exporter

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

X CNRS INRIA ENS-CACHAN LIX X-LIX X-DEP-INFO CENTRALESUPELEC CRISTAL UNIV-LORRAINE INRIA2 CRISTAL-MAGNET LORIA LORIA-FM UNIV-PARIS-SACLAY UNIV-LILLE IP_PARIS UP-SCIENCES ENS-PARIS-SACLAY GS-COMPUTER-SCIENCE LMF IRIF

237 Consultations

0 Téléchargements