Theoretical Computer Science: Computability, Decidability and Logic

Olivier Bournez; Gilles Dowek; Rémi Gilleron; Serge Grigorieff; Jean Yves Marion; Simon Perdrix; Sophie Tison

doi:10.1007/978-3-030-06170-8_1

Theoretical Computer Science: Computability, Decidability and Logic

Olivier Bournez, Gilles Dowek, Rémi Gilleron, Serge Grigorieff, Jean Yves Marion, Simon Perdrix, Sophie Tison

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Abstract

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.

Original language	English
Title of host publication	A Guided Tour of Artificial Intelligence Research
Subtitle of host publication	Volume III: Interfaces and Applications of Artificial Intelligence
Publisher	Springer International Publishing
Pages	1-50
Number of pages	50
Volume	3
ISBN (Electronic)	9783030061708
ISBN (Print)	9783030061692
DOIs	https://doi.org/10.1007/978-3-030-06170-8_1
Publication status	Published - 1 Jan 2020

Access to Document

10.1007/978-3-030-06170-8_1

Cite this

Bournez, O., Dowek, G., Gilleron, R., Grigorieff, S., Marion, J. Y., Perdrix, S., & Tison, S. (2020). Theoretical Computer Science: Computability, Decidability and Logic. In A Guided Tour of Artificial Intelligence Research: Volume III: Interfaces and Applications of Artificial Intelligence (Vol. 3, pp. 1-50). Springer International Publishing. https://doi.org/10.1007/978-3-030-06170-8_1

@inbook{ea10b0c40e9e493f88a3f3ea9a271c23,

title = "Theoretical Computer Science: Computability, Decidability and Logic",

abstract = "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.",

author = "Olivier Bournez and Gilles Dowek and R{\'e}mi Gilleron and Serge Grigorieff and Marion, \{Jean Yves\} and Simon Perdrix and Sophie Tison",

note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2020.",

year = "2020",

month = jan,

day = "1",

doi = "10.1007/978-3-030-06170-8\_1",

language = "English",

isbn = "9783030061692",

volume = "3",

pages = "1--50",

booktitle = "A Guided Tour of Artificial Intelligence Research",

publisher = "Springer International Publishing",

}

Bournez, O, Dowek, G, Gilleron, R, Grigorieff, S, Marion, JY, Perdrix, S & Tison, S 2020, Theoretical Computer Science: Computability, Decidability and Logic. in A Guided Tour of Artificial Intelligence Research: Volume III: Interfaces and Applications of Artificial Intelligence. vol. 3, Springer International Publishing, pp. 1-50. https://doi.org/10.1007/978-3-030-06170-8_1

Theoretical Computer Science: Computability, Decidability and Logic. / Bournez, Olivier; Dowek, Gilles; Gilleron, Rémi et al.
A Guided Tour of Artificial Intelligence Research: Volume III: Interfaces and Applications of Artificial Intelligence. Vol. 3 Springer International Publishing, 2020. p. 1-50.

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - Theoretical Computer Science

T2 - Computability, Decidability and Logic

AU - Bournez, Olivier

AU - Dowek, Gilles

AU - Gilleron, Rémi

AU - Grigorieff, Serge

AU - Marion, Jean Yves

AU - Perdrix, Simon

AU - Tison, Sophie

PY - 2020/1/1

Y1 - 2020/1/1

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/105008856254

U2 - 10.1007/978-3-030-06170-8_1

DO - 10.1007/978-3-030-06170-8_1

M3 - Chapter

AN - SCOPUS:105008856254

SN - 9783030061692

VL - 3

SP - 1

EP - 50

BT - A Guided Tour of Artificial Intelligence Research

PB - Springer International Publishing

ER -

Theoretical Computer Science: Computability, Decidability and Logic

Abstract

Access to Document

Other files and links

Fingerprint

Cite this