<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">ZVI RETCHKIMAN KÖNIGSBERG</style></author><author><style face="normal" font="default" size="100%">NACHUM DERSHOWITZ</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">THE CHURCH THESIS, ITS PROOF, AND THE NOTION OF STABILITY AND STABILIZATION FOR ANALOG ALGORITHMS</style></title></titles><keywords><keyword><style  face="normal" font="default" size="100%">03B05</style></keyword><keyword><style  face="normal" font="default" size="100%">03D99</style></keyword><keyword><style  face="normal" font="default" size="100%">68Q01</style></keyword><keyword><style  face="normal" font="default" size="100%">93D05</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2019</style></year><pub-dates><date><style  face="normal" font="default" size="100%">12/2018</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://acadsol.eu/en/articles/23/2/1.pdf</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">23</style></volume><pages><style face="normal" font="default" size="100%">16</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p class=&quot;rtejustify&quot;&gt;This work presents the Church thesis, its proof, and the&amp;nbsp;notion of stability and stabilization for analog algorithms. The Church thesis&amp;nbsp;for discrete algorithms motivates us to consider the Church thesis for the case&amp;nbsp;when we are dealing with analog algorithms. Its presentation and proof follows&amp;nbsp;a similar construction to the one given for discrete algorithms. The notions of&amp;nbsp;analog algorithm and dynamical system are postulated to be equivalent. The&amp;nbsp;stability and stabilization concepts for analog algorithms are defined. The&amp;nbsp;stability and stabilization presentation starts concentrating in continuous and&amp;nbsp;discrete dynamical systems i.e., analog algorithms, described by differential or&amp;nbsp;difference equations and continues considering Lyapunov energy functions.&lt;/p&gt;
</style></abstract><issue><style face="normal" font="default" size="100%">2</style></issue><section><style face="normal" font="default" size="100%">233</style></section></record></records></xml>