Models of computation. An introduction to computability theory

DOI10.1007/978-1-84882-434-8zbMATH Open1189.68062OpenAlexW4238194925MaRDI QIDQ1007225FDOQ1007225

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 machinesLambda-CalculusLogic-based computation modelsRecursive functions

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computability and recursion theory (03D99)

Cited In (7)

• Some thoughts on computational models: from massive human computing to abstract state machines, and beyond
• Computational model theory: an overview
• Res Publica: The Universal Model of Computation (Invited Talk)
• Title not available (Why is that?)
• Levels of undecidability in rewriting
• Title not available (Why is that?)
• Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus

Uses Software

• OCaml

This page was built for publication: Models of computation. An introduction to computability theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007225)