On the regulator problem for linear systems over rings and algebras

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).

The Creation of a Conscious Machine

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.

The Creation of a Conscious Machine

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.

Filtering method for linear and non-linear stochastic optimal control of partially observable systems

This paper studies two linear methods for linear and non-linear stochastic optimal control of partially observable problem (SOCPP). At first, it introduces the general form of a SOCPP and states it as a functional matrix. A SOCPP has a payoff function which should be minimized. It also has two dynamic processes: state and observation. In this study, it is presented a deterministic method to find the control factor which has named feedback control and stated a modified complete proof of control optimality in a general SOCPP. After finding the optimal control factor, it should be substituted in the state process to make the partially observable system. Next, it introduces a linear filtering method to solve the related partially observable system with complete details. Finally, it is presented a heuristic method in discrete form for estimating non-linear SOCPPs and it is stated some examples to evaluate the performance of introducing methods.