Axiomatizing analog algorithms

Olivier Bournez; Nachum Dershowitz; Pierre Néron

doi:10.1007/978-3-319-40189-8_22

Axiomatizing analog algorithms

Olivier Bournez^*, Nachum Dershowitz, Pierre Néron

^*Corresponding author for this work

School of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We propose a formalization of generic algorithms that includes analog algorithms. This is achieved by reformulating and extending the framework of abstract state machines to include continuous-time models of computation. We prove that every hybrid algorithm satisfying some reasonable postulates may be expressed precisely by a program in a simple and expressive language.

Original language	English
Title of host publication	Pursuit of the Universal - 12th Conference on Computability in Europe, CiE 2016, Proceedings
Editors	Nataša Jonoska, Laurent Bienvenu, Arnold Beckmann
Publisher	Springer Verlag
Pages	215-224
Number of pages	10
ISBN (Print)	9783319401881
DOIs	https://doi.org/10.1007/978-3-319-40189-8_22
State	Published - 2016
Event	12th Conference on Computability in Europe, CiE 2016 - Paris, France Duration: 27 Jun 2016 → 1 Jul 2016

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	9709
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	12th Conference on Computability in Europe, CiE 2016
Country/Territory	France
City	Paris
Period	27/06/16 → 1/07/16

Access to Document

10.1007/978-3-319-40189-8_22

Cite this

Bournez, O., Dershowitz, N., & Néron, P. (2016). Axiomatizing analog algorithms. In N. Jonoska, L. Bienvenu, & A. Beckmann (Eds.), Pursuit of the Universal - 12th Conference on Computability in Europe, CiE 2016, Proceedings (pp. 215-224). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9709). Springer Verlag. https://doi.org/10.1007/978-3-319-40189-8_22

Bournez, Olivier ; Dershowitz, Nachum ; Néron, Pierre. / Axiomatizing analog algorithms. Pursuit of the Universal - 12th Conference on Computability in Europe, CiE 2016, Proceedings. editor / Nataša Jonoska ; Laurent Bienvenu ; Arnold Beckmann. Springer Verlag, 2016. pp. 215-224 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{64c7af472488496b9d041c0840a45ebd,

title = "Axiomatizing analog algorithms",

abstract = "We propose a formalization of generic algorithms that includes analog algorithms. This is achieved by reformulating and extending the framework of abstract state machines to include continuous-time models of computation. We prove that every hybrid algorithm satisfying some reasonable postulates may be expressed precisely by a program in a simple and expressive language.",

author = "Olivier Bournez and Nachum Dershowitz and Pierre N{\'e}ron",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2016.; 12th Conference on Computability in Europe, CiE 2016 ; Conference date: 27-06-2016 Through 01-07-2016",

year = "2016",

doi = "10.1007/978-3-319-40189-8_22",

language = "אנגלית",

isbn = "9783319401881",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "215--224",

editor = "Nata{\v s}a Jonoska and Laurent Bienvenu and Arnold Beckmann",

booktitle = "Pursuit of the Universal - 12th Conference on Computability in Europe, CiE 2016, Proceedings",

}

Bournez, O, Dershowitz, N & Néron, P 2016, Axiomatizing analog algorithms. in N Jonoska, L Bienvenu & A Beckmann (eds), Pursuit of the Universal - 12th Conference on Computability in Europe, CiE 2016, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9709, Springer Verlag, pp. 215-224, 12th Conference on Computability in Europe, CiE 2016, Paris, France, 27/06/16. https://doi.org/10.1007/978-3-319-40189-8_22

Axiomatizing analog algorithms. / Bournez, Olivier; Dershowitz, Nachum; Néron, Pierre.
Pursuit of the Universal - 12th Conference on Computability in Europe, CiE 2016, Proceedings. ed. / Nataša Jonoska; Laurent Bienvenu; Arnold Beckmann. Springer Verlag, 2016. p. 215-224 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9709).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Axiomatizing analog algorithms

AU - Bournez, Olivier

AU - Dershowitz, Nachum

AU - Néron, Pierre

N1 - Publisher Copyright: © Springer International Publishing Switzerland 2016.

PY - 2016

Y1 - 2016

N2 - We propose a formalization of generic algorithms that includes analog algorithms. This is achieved by reformulating and extending the framework of abstract state machines to include continuous-time models of computation. We prove that every hybrid algorithm satisfying some reasonable postulates may be expressed precisely by a program in a simple and expressive language.

AB - We propose a formalization of generic algorithms that includes analog algorithms. This is achieved by reformulating and extending the framework of abstract state machines to include continuous-time models of computation. We prove that every hybrid algorithm satisfying some reasonable postulates may be expressed precisely by a program in a simple and expressive language.

UR - http://www.scopus.com/inward/record.url?scp=84976611927&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-40189-8_22

DO - 10.1007/978-3-319-40189-8_22

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84976611927

SN - 9783319401881

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 215

EP - 224

BT - Pursuit of the Universal - 12th Conference on Computability in Europe, CiE 2016, Proceedings

A2 - Jonoska, Nataša

A2 - Bienvenu, Laurent

A2 - Beckmann, Arnold

PB - Springer Verlag

T2 - 12th Conference on Computability in Europe, CiE 2016

Y2 - 27 June 2016 through 1 July 2016

ER -

Bournez O, Dershowitz N, Néron P. Axiomatizing analog algorithms. In Jonoska N, Bienvenu L, Beckmann A, editors, Pursuit of the Universal - 12th Conference on Computability in Europe, CiE 2016, Proceedings. Springer Verlag. 2016. p. 215-224. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-40189-8_22

Axiomatizing analog algorithms

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this