Models of computation. An introduction to computability theory

DOI10.1007/978-1-84882-434-8MaRDI QIDQ1007225zbMATH OpenOpenAlexFDO

Authors 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

Lambda-CalculusLogic-based computation modelsRecursive functionsTuring machines

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 225477
• scientific article; zbMATH DE number 1880324
• Models of computation
• Formal models of computation. The ultimate limits of computing
• Turing computability. Theory and applications

Cited in

(12)

• Models of computation
• Some thoughts on computational models: from massive human computing to abstract state machines, and beyond
• Computable execution traces
• Formal models of computation. The ultimate limits of computing
• scientific article; zbMATH DE number 1731510 (Why is no real title available?)
• Res Publica: The Universal Model of Computation (Invited Talk)
• Least upper bounds on the size of Church-Rosser diagrams in term rewriting and -calculus
• scientific article; zbMATH DE number 4128803 (Why is no real title available?)
• Computational model theory: an overview
• scientific article; zbMATH DE number 7340320 (Why is no real title available?)
• scientific article; zbMATH DE number 7647926 (Why is no real title available?)
• Levels of undecidability in rewriting

Describes a project that uses

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)