Towards an Axiomatization of Simple Analog Algorithms

DOI10.1007/978-3-642-29952-0_49MaRDI QIDQ2898065zbMATH OpenOpenAlexFDO

Authors Nachum Dershowitz, Evgenia Falkovich, Olivier Bournez

Publication date 16 July 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-29952-0_49

Mathematics Subject Classification ID

General topics in the theory of algorithms (68W01)

Recommendations

• Axiomatizing analog algorithms
• A Step towards a Complexity Theory for Analog Systems
• Abstract algebraic structure of analytic theory of algorithms
• The complexity of analog computation
• A Differentially Algebraic Replacement Theorem, and Analog Computability
• A Survey on Analog Models of Computation
• Towards a calculus of algorithms
• Boolean analogical proportions -- axiomatics and algorithmic complexity issues
• First-order approximation of algorithmic theories

Cited in

(3)

• A Differentially Algebraic Replacement Theorem, and Analog Computability
• Axiomatizing analog algorithms
• A Survey on Analog Models of Computation

This page was built for publication: Towards an Axiomatization of Simple Analog Algorithms

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