Grant: Discovery Grants Program - Individual
McMaster University
$34,000.00
Computation on Topological Algebras: Analog and Digital Paradigms
FY 2023-24
Summary
My long-term research goal is to develop a generalized theory of computation, incorporating digital, analog and hybrid models. This work is theoretical, but has practical applications in the construction of "smart systems" with hybrid networks of analog and digital components. Background: Digital computation Computation models exist in two main paradigms: digital and analog. Both forms process infinite data, typically real numbers, originating from measurements. In digital computation, the data are represented symbolically. In analog computation, the data are represented by physical quantities which can be measured. In hybrid computation, both processes are combined. My past research involved the generalization of classical (digital) computability theory to the real numbers, and to metric and topological algebras. Many models of digital computation have been studied, e.g. those of Grzegzorczyk and Lacombe, Weihrauch, and tracking computability (Malcev, Tucker, Stoltenberg-Hansen). The equivalence of many of these has been proved by (among others) John Tucker, myself and our students. Most of the above has involved digital computation models. We turn to analog computation. Background: Analog computation The modern theory begins with Shannon's GPAC ("General Purpose Analog Computer"), as developed by Pour-El, Moore, Costa, Bournez, Graca and others. The GPAC has modules for performing elementary operations on real numbers (representing physical quantities), connected by channels for streams of real numbers (representing functions of time t). Shannon proved GPAC computability to be equivalent to definability by a system of algebraic differential equations. The paper [TZ07] was seminal for our later work. In it Tucker and I developed a fixed point semantics for analog networks with continuous streams of reals. My PhD student Diogo Pocas extended Shannon's GPAC by including (1) an extra space variable x with a partial differential module; and (2) a "limiting process" module. We call such GPACs "multivariate". Long term goal Developing a systematic theory of computation, incorporating digital, analog and hybrid models. Short term goals (1) Although many equivalences have been proved among various digital models, much remains to be done in comparing strengths of analog and digital models, e.g finding a version of the multivariate GPAC equivalent to tracking computability. (2) Use the results in (1) to formulate a Generalized Church-Turing Thesis, applicable to analog as well as digital systems. Impact Given the increasing importance and ubiquity of "smart systems", incorporating hybrid networks with analog and digital components, the necessity for a systematic theory of such systems is clear. Such systems offer Canadian industry an agenda for high-tech developments. The design of such complex systems requires a good theoretical framework, which this project aims to offer.
Program
Discovery Grants Program - Individual
Recipient
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
RGPIN-2019-07063
Name nom
Zucker, Jeffery
Department département
Computing and Software
Organization id
27
Institution établissement
McMaster University
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2023
Competition year année de concours
2019
Award amount
34000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
DISCOVERY RESEARCH
Group fr
RECHERCHE AXÉE SUR LA DÉCOUVERTE
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
803
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Computer communications
Area of application fr
Téléinformatique
Research subject code
2960
Research subject group en
Applied mathematics
Research subject group fr
Mathematical modelling
Research subject en
Mathématiques appliquées
Research subject fr
Modélisation mathématique
Application title
Computation on Topological Algebras: Analog and Digital Paradigms
Keyword
analog computing; computation theory; computing on the reals; computing on topological algebras; generalized computation theory; models of computation
Application summary
My long-term research goal is to develop a generalized theory of computation, incorporating digital, analog and hybrid models. This work is theoretical, but has practical applications in the construction of "smart systems" with hybrid networks of analog and digital components. Background: Digital computation Computation models exist in two main paradigms: digital and analog. Both forms process infinite data, typically real numbers, originating from measurements. In digital computation, the data are represented symbolically. In analog computation, the data are represented by physical quantities which can be measured. In hybrid computation, both processes are combined. My past research involved the generalization of classical (digital) computability theory to the real numbers, and to metric and topological algebras. Many models of digital computation have been studied, e.g. those of Grzegzorczyk and Lacombe, Weihrauch, and tracking computability (Malcev, Tucker, Stoltenberg-Hansen). The equivalence of many of these has been proved by (among others) John Tucker, myself and our students. Most of the above has involved digital computation models. We turn to analog computation. Background: Analog computation The modern theory begins with Shannon's GPAC ("General Purpose Analog Computer"), as developed by Pour-El, Moore, Costa, Bournez, Graca and others. The GPAC has modules for performing elementary operations on real numbers (representing physical quantities), connected by channels for streams of real numbers (representing functions of time t). Shannon proved GPAC computability to be equivalent to definability by a system of algebraic differential equations. The paper [TZ07] was seminal for our later work. In it Tucker and I developed a fixed point semantics for analog networks with continuous streams of reals. My PhD student Diogo Pocas extended Shannon's GPAC by including (1) an extra space variable x with a partial differential module; and (2) a "limiting process" module. We call such GPACs "multivariate". Long term goal Developing a systematic theory of computation, incorporating digital, analog and hybrid models. Short term goals (1) Although many equivalences have been proved among various digital models, much remains to be done in comparing strengths of analog and digital models, e.g finding a version of the multivariate GPAC equivalent to tracking computability. (2) Use the results in (1) to formulate a Generalized Church-Turing Thesis, applicable to analog as well as digital systems. Impact Given the increasing importance and ubiquity of "smart systems", incorporating hybrid networks with analog and digital components, the necessity for a systematic theory of such systems is clear. Such systems offer Canadian industry an agenda for high-tech developments. The design of such complex systems requires a good theoretical framework, which this project aims to offer.