Theoretical Computer Science: Computability, Decidability and Logic

  • Bournez O
  • Dowek G
  • Gilleron R
  • et al.
N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

… The 2283 and 3176 pages of the Handbooks (van Leeuwen 1990; Abramsky et al. 2001) witness that theoretical computer science is a vast domain … 2.1 Discrete Computation Models Based on Mathematics. Primitive Recursion …

Cite

CITATION STYLE

APA

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 (pp. 1–50). Springer International Publishing. https://doi.org/10.1007/978-3-030-06170-8_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free