Algorithms and the mathematical foundations of computer science

DOI10.1093/ACPROF:OSO/9780198759591.003.0002zbMATH Open1433.03108OpenAlexW2239392219MaRDI QIDQ5221589FDOQ5221589

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

Recommendations

• scientific article; zbMATH DE number 3934392
• scientific article; zbMATH DE number 3982510
• scientific article; zbMATH DE number 2155189
• scientific article; zbMATH DE number 1301806
• scientific article; zbMATH DE number 3936508

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 (7)

• When are Two Algorithms the Same?
• Title not available (Why is that?)
• The halting problem and security’s language-theoretic approach: Praise and criticism from a technical historian
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)