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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bournez, O., Dershowitz, N., Néron, P.: Axiomatizing analog algorithms. In: Beckmann, A., Bienvenu, L., Jonoska, N. (eds.) CiE 2016. LNCS, vol. 9709, pp. 215–224. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-40189-8_22. http://nachum.org/papers/AxiomatizationAnalog.pdf, https://arxiv.org/pdf/1604.04295v2.pdf
Dershowitz, N., Gurevich, Y.: A natural axiomatization of computability and proof of Church’s Thesis. Bull. Symbolic Logic 14, 299–350 (2008). http://nachum.org/papers/Church.pdf
Gurevich, Y.: Sequential abstract state machines capture sequential algorithms. ACM Trans. Comput. Logic 1, 77–111 (2000). http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.146.3017&rep=rep1&type=pdf
Heimsch, T.F., Leine, R.I.: A novel Lyapunov-like method for the non-autonomous bouncing ball system. In: Proceedings of the 7th European Nonlinear Dynamics Conference (ENOC), Rome (2011)
Retchkiman, Z., Dershowitz, N.: The Church thesis, its proof, and the notion of stability and stabilization for analog algorithms. Commun. Appl. Anal. 23, 233–248 (2019)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Dershowitz, N., Retchkiman Königsberg, Z. (2019). Computability and Stability for Hybrid Algorithms. In: Tan, Y., Shi, Y., Niu, B. (eds) Advances in Swarm Intelligence. ICSI 2019. Lecture Notes in Computer Science(), vol 11655. Springer, Cham. https://doi.org/10.1007/978-3-030-26369-0_37
Download citation
DOI: https://doi.org/10.1007/978-3-030-26369-0_37
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-26368-3
Online ISBN: 978-3-030-26369-0
eBook Packages: Computer ScienceComputer Science (R0)