Algorithms and the mathematical foundations of computer science

DOI10.1093/ACPROF:OSO/9780198759591.003.0002MaRDI QIDQ5221589zbMATH OpenOpenAlexFDO

Authors Walter Dean

Publication date 2 April 2020

Published in Gödel's Disjunction (Search for Journal in Brave)

Full work available at URL http://wrap.warwick.ac.uk/74181/7/WRAP_Dean2016a.pdf

zbMATH Keywords

algorithmcomputabilityChurch thesis

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) General topics in the theory of algorithms (68W01) General topics in the theory of computing (68Q01)

Cited in

(9)

• When are Two Algorithms the Same?
• scientific article; zbMATH DE number 2027971 (Why is no real title available?)
• The halting problem and security’s language-theoretic approach: Praise and criticism from a technical historian
• scientific article; zbMATH DE number 3934391 (Why is no real title available?)
• scientific article; zbMATH DE number 4170051 (Why is no real title available?)
• scientific article; zbMATH DE number 1515258 (Why is no real title available?)
• Toward an algorithmic metaphysics
• Bringing mathematics education into the algorithmic age
• Execution trace sets for real computation

This page was built for publication: Algorithms and the mathematical foundations of computer science

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