Is any SISO controllable and observable system dynamically passifiable and/or L2-stabilizable?

Author(s):  
M. Sassano ◽  
A. Astolfi
Keyword(s):  
2008 ◽  
Vol 688 (2) ◽  
pp. 1235-1249 ◽  
Author(s):  
N. Madhusudhan ◽  
S. Rappaport ◽  
Ph. Podsiadlowski ◽  
L. Nelson

2017 ◽  
Author(s):  
Jean E. Tardy

The Meca Sapiens project follows a Top-down process to develop the conceptual foundations of synthetic consciousness. The Creation of a Conscious Machine corresponds to the Requirements and Specifications document of this process. It describes the extraordinary intellectual benefits to be gained from the implementation of conscious machines. It surveys historical attempts to define and implement machine intelligence and the insights they reveal. In particular, it examines the Turing Test is analyzed in detail through multiple variations and finds it to be both excessive and insufficient as a measure of machine intelligence. The text concludes by introducing a new understanding of consciousness as an observable system capability that can be expressed as specification objectives that are compatible with software implementation. This understanding is the basis for The Meca Sapiens Blueprint, a complete System Architecture to implement synthetic consciousness using conventional computers and standard techniques.


2021 ◽  
Vol 19 (1) ◽  
pp. 101-110
Author(s):  
José Ángel Hermida-Alonso ◽  
Miguel V. Carriegos ◽  
Andrés Sáez-Schwedt ◽  
Tomás Sánchez-Giralda

Abstract The regulator problem is solvable for a linear dynamical system Σ \Sigma if and only if Σ \Sigma is both pole assignable and state estimable. In this case, Σ \Sigma is a canonical system (i.e., reachable and observable). When the ring R R is a field or a Noetherian total ring of fractions the converse is true. Commutative rings which have the property that the regulator problem is solvable for every canonical system (RP-rings) are characterized as the class of rings where every observable system is state estimable (SE-rings), and this class is shown to be equal to the class of rings where every reachable system is pole-assignable (PA-rings) and the dual of a canonical system is also canonical (DP-rings).


Sign in / Sign up

Export Citation Format

Share Document