Models of computation. An introduction to computability theory

DOI10.1007/978-1-84882-434-8zbMath1189.68062MaRDI QIDQ1007225

Maribel Fernández

Publication date: 20 March 2009

Published in: Undergraduate Topics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-84882-434-8

zbMATH Keywords

Turing machines; Lambda-Calculus; Logic-based computation models; Recursive functions

Mathematics Subject Classification ID

68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

03D99: Computability and recursion theory

Related Items

Levels of undecidability in rewriting, Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus

Uses Software

• OCaml