Axiomatizing Analog Algorithms

DOI10.1007/978-3-319-40189-8_22zbMath1475.68460arXiv1604.04295OpenAlexW2337125309MaRDI QIDQ3188259

Nachum Dershowitz, Pierre Neron, Olivier Bournez

Publication date: 17 August 2016

Published in: Pursuit of the Universal (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.04295

Mathematics Subject Classification ID

General topics in the theory of algorithms (68W01) Other nonclassical models of computation (68Q09)

Related Items (3)

What is the Church-Turing Thesis? ⋮ Axiomatizing Analog Algorithms ⋮ A Survey on Analog Models of Computation

Cites Work

• Unnamed Item
• Computational bounds on polynomial differential equations
• Differential dynamic logic for hybrid systems
• On Gurevich's theorem on sequential algorithms
• Analog computers and recursive functions over the reals.
• The differential analyzer. A new machine for solving differential equations
• Models of computation for partial functions on the reals
• Towards an Axiomatization of Simple Analog Algorithms
• Programming with Infinitesimals: A While-Language for Hybrid System Modeling
• Axiomatizing Analog Algorithms
• Three Paths to Effectiveness
• A Natural Axiomatization of Computability and Proof of Church's Thesis
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• The Church-Turing Thesis over Arbitrary Domains
• New Computational Paradigms
• Sequential abstract-state machines capture sequential algorithms
• Mathematical Theory of the Differential Analyzer

This page was built for publication: Axiomatizing Analog Algorithms