Towards an axiomatization of simple analog algorithms

Olivier Bournez*, Nachum Dershowitz, Evgenia Falkovich

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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

Original languageEnglish
Title of host publicationTheory and Applications of Models of Computation - 9th Annual Conference, TAMC 2012, Proceedings
Pages525-536
Number of pages12
DOIs
StatePublished - 2012
Event9th Annual Conference on Theory and Applications of Models of Computation, TAMC 2012 - Beijing, China
Duration: 16 May 201221 May 2012

Publication series

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

Conference

Conference9th Annual Conference on Theory and Applications of Models of Computation, TAMC 2012
Country/TerritoryChina
CityBeijing
Period16/05/1221/05/12

Fingerprint

Dive into the research topics of 'Towards an axiomatization of simple analog algorithms'. Together they form a unique fingerprint.

Cite this