Computability and stability for hybrid algorithms

Nachum Dershowitz, Zvi Retchkiman Königsberg*

*Corresponding author for this work

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

Abstract

Church’s Thesis for discrete algorithms motivates an analogous thesis for dealing with analog algorithms. Specifically, the notions of analog algorithm and dynamical system are postulated to be equivalent. Stability for hybrid algorithms is addressed by considering Lyapunov energy functions for analog algorithms with continuous and discontinuous states.

Original languageEnglish
Title of host publicationAdvances in Swarm Intelligence - 10th International Conference, ICSI 2019, Proceedings
EditorsYing Tan, Yuhui Shi, Ben Niu
PublisherSpringer Verlag
Pages395-401
Number of pages7
ISBN (Print)9783030263683
DOIs
StatePublished - 2019
Event10th International Conference on Swarm Intelligence, ICSI 2019 - Chiang Mai, Thailand
Duration: 26 Jul 201930 Jul 2019

Publication series

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

Conference

Conference10th International Conference on Swarm Intelligence, ICSI 2019
Country/TerritoryThailand
CityChiang Mai
Period26/07/1930/07/19

Keywords

  • Analog algorithms
  • Church’s Thesis
  • Dynamical systems
  • Hybrid systems
  • Lyapunov functions
  • Stability

Fingerprint

Dive into the research topics of 'Computability and stability for hybrid algorithms'. Together they form a unique fingerprint.

Cite this