Remote State Estimation and Blum–Shub–Smale Machines—A Computability Analysis With Applications to Virtual Twinning

This article analyzes aspects of the problem of <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">remote state estimation</i> (RSE) <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">via noisy communication channels</i> for their <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Blum–Shub–Smale</i> (BSS) computability, motivated by an exemplary application to a formal model of virtual twinning subject to stringent integrity requirements. Computability theory provides a unique framework for the formal and mathematically rigorous analysis of algorithms and computing machines. Therefore, computability theory is essential in the domain of safety- and life-critical technology, where the formal verification of automated systems is necessary. Based on the RSE problem, we establish a simple mathematical model of virtual-twin systems that entails a formal notion of <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">integrity</i> (i.e., a state where the virtual entity accurately mirrors its physical counterpart). The model's notion of integrity is related to the question of whether the system under consideration is capable of computing the communication channel's zero-error capacity and corresponding zero-error codes. While this task is known to exceed the theoretical capabilities of Turing computers, we prove its formal feasibility within the model BSS machines. As different authors have proposed BSS machines as potential model of some forms of analog computing, this article serves as a proof-of-concept for a theoretical <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">analog supremacy</i> of unconventional information-processing hardware. Considering recent advances in the development of such hardware, forms of analog supremacy will likely become relevant in the future of cyber-physical systems and information technology.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Automatic Control
Published
2024-11-19
DOI
https://doi.org/10.1109/tac.2024.3502314
Citations
5
Primary Topic
Computability, Logic, AI Algorithms
Type
article
Field-Weighted Citation Impact
1.81
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Remote State Estimation and Blum–Shub–Smale Machines—A Computability Analysis With Applications to Virtual Twinning

Holger Boche, Frank H. P. Fitzek, Yannik Böck, Christian Deppe
5 citations
IEEE Transactions on Automatic Control
Computability, Logic, AI Algorithms
1.81
article

Remote State Estimation and Blum–Shub–Smale Machines—A Computability Analysis With Applications to Virtual Twinning

Holger Boche, Frank H. P. Fitzek, Yannik Böck, Christian Deppe
article en
5 citations

Abstract

This article analyzes aspects of the problem of <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">remote state estimation</i> (RSE) <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">via noisy communication channels</i> for their <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Blum–Shub–Smale</i> (BSS) computability, motivated by an exemplary application to a formal model of virtual twinning subject to stringent integrity requirements. Computability theory provides a unique framework for the formal and mathematically rigorous analysis of algorithms and computing machines. Therefore, computability theory is essential in the domain of safety- and life-critical technology, where the formal verification of automated systems is necessary. Based on the RSE problem, we establish a simple mathematical model of virtual-twin systems that entails a formal notion of <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">integrity</i> (i.e., a state where the virtual entity accurately mirrors its physical counterpart). The model's notion of integrity is related to the question of whether the system under consideration is capable of computing the communication channel's zero-error capacity and corresponding zero-error codes. While this task is known to exceed the theoretical capabilities of Turing computers, we prove its formal feasibility within the model BSS machines. As different authors have proposed BSS machines as potential model of some forms of analog computing, this article serves as a proof-of-concept for a theoretical <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">analog supremacy</i> of unconventional information-processing hardware. Considering recent advances in the development of such hardware, forms of analog supremacy will likely become relevant in the future of cyber-physical systems and information technology.

IEEE Transactions on Automatic ControlVol. 70(5)
Deutsche Telekom (Germany) (DE), Technical University of Munich (DE), Technische Universität Braunschweig (DE)
Openalex Percentile: Top 13%
Computability, Logic, AI Algorithms
1.81
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.