Towards an axiomatization of simple analog algorithms

Olivier Bournez; Nachum Dershowitz; Evgenia Falkovich

doi:10.1007/978-3-642-29952-0_49

Towards an axiomatization of simple analog algorithms

Olivier Bournez^*, Nachum Dershowitz, Evgenia Falkovich

^*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 analog algorithms, extending the framework of abstract state machines to continuous-time models of computation.

Original language	English
Title of host publication	Theory and Applications of Models of Computation - 9th Annual Conference, TAMC 2012, Proceedings
Pages	525-536
Number of pages	12
DOIs	https://doi.org/10.1007/978-3-642-29952-0_49
State	Published - 2012
Event	9th Annual Conference on Theory and Applications of Models of Computation, TAMC 2012 - Beijing, China Duration: 16 May 2012 → 21 May 2012

Publication series

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

Conference

Conference	9th Annual Conference on Theory and Applications of Models of Computation, TAMC 2012
Country/Territory	China
City	Beijing
Period	16/05/12 → 21/05/12

Access to Document

10.1007/978-3-642-29952-0_49

Cite this

Bournez, O., Dershowitz, N., & Falkovich, E. (2012). Towards an axiomatization of simple analog algorithms. In Theory and Applications of Models of Computation - 9th Annual Conference, TAMC 2012, Proceedings (pp. 525-536). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7287 LNCS). https://doi.org/10.1007/978-3-642-29952-0_49

@inproceedings{721b5dadd3dc4a6fbcf09055267dc720,

title = "Towards an axiomatization of simple analog algorithms",

abstract = "We propose a formalization of analog algorithms, extending the framework of abstract state machines to continuous-time models of computation.",

author = "Olivier Bournez and Nachum Dershowitz and Evgenia Falkovich",

year = "2012",

doi = "10.1007/978-3-642-29952-0_49",

language = "אנגלית",

isbn = "9783642299513",

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

pages = "525--536",

booktitle = "Theory and Applications of Models of Computation - 9th Annual Conference, TAMC 2012, Proceedings",

note = "null ; Conference date: 16-05-2012 Through 21-05-2012",

}

Bournez, O, Dershowitz, N & Falkovich, E 2012, Towards an axiomatization of simple analog algorithms. in Theory and Applications of Models of Computation - 9th Annual Conference, TAMC 2012, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7287 LNCS, pp. 525-536, 9th Annual Conference on Theory and Applications of Models of Computation, TAMC 2012, Beijing, China, 16/05/12. https://doi.org/10.1007/978-3-642-29952-0_49

Towards an axiomatization of simple analog algorithms. / Bournez, Olivier; Dershowitz, Nachum; Falkovich, Evgenia.

Theory and Applications of Models of Computation - 9th Annual Conference, TAMC 2012, Proceedings. 2012. p. 525-536 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7287 LNCS).

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

TY - GEN

T1 - Towards an axiomatization of simple analog algorithms

AU - Bournez, Olivier

AU - Dershowitz, Nachum

AU - Falkovich, Evgenia

PY - 2012

Y1 - 2012

N2 - We propose a formalization of analog algorithms, extending the framework of abstract state machines to continuous-time models of computation.

AB - We propose a formalization of analog algorithms, extending the framework of abstract state machines to continuous-time models of computation.

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

U2 - 10.1007/978-3-642-29952-0_49

DO - 10.1007/978-3-642-29952-0_49

M3 - פרסום בספר כנס

AN - SCOPUS:84861013408

SN - 9783642299513

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

SP - 525

EP - 536

BT - Theory and Applications of Models of Computation - 9th Annual Conference, TAMC 2012, Proceedings

Y2 - 16 May 2012 through 21 May 2012

ER -

Bournez O, Dershowitz N, Falkovich E. Towards an axiomatization of simple analog algorithms. In Theory and Applications of Models of Computation - 9th Annual Conference, TAMC 2012, Proceedings. 2012. p. 525-536. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-29952-0_49

Towards an axiomatization of simple analog algorithms

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this