Mathematical informatics: algorithms

DOI10.1007/978-3-032-31348-5_6MaRDI QIDQ7411953zbMATH OpenFDO

Authors Thomas Seiller

Publication date 2027

Full work available at URL https://doi.org/10.1007/978-3-032-31348-5_6

zbMATH Keywords

computabilitydynamical systemsmodels of computation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A new recursion-theoretic characterization of the polytime functions
• Algorithms and the mathematical foundations of computer science
• An unsolvable problem of elementary number theory.
• scientific article; zbMATH DE number 1687041 (Why is no real title available?)
• scientific article; zbMATH DE number 3119278 (Why is no real title available?)
• scientific article; zbMATH DE number 3146798 (Why is no real title available?)
• scientific article; zbMATH DE number 5604097 (Why is no real title available?)
• scientific article; zbMATH DE number 1301806 (Why is no real title available?)
• scientific article; zbMATH DE number 3092551 (Why is no real title available?)
• Recursive Functionals and Quantifiers of Finite Types I
• Sequential abstract-state machines capture sequential algorithms
• Towards a definition of an algorithm
• What is an algorithm?

This page was built for publication: Mathematical informatics: algorithms

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