The destiny of constant structure discrete time closed semantic systems

11/19/2017
by   Evgeny Ivanko, et al.
0

Constant structure closed semantic systems are the systems each element of which receives its definition through the correspondent unchangeable set of other elements of the system. Discrete time means here that the definitions of the elements change iteratively and simultaneously based on the "neighbor portraits" from the previous iteration. I prove that the iterative redefinition process in such class of systems will quickly degenerate into a series of pairwise isomorphic states and discuss some directions of further research.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/28/2022

On the maximal solution of the conjugate discrete-time algebraic Riccati equation

In this paper we consider a class of conjugate discrete-time Riccati equ...
research
12/23/2018

Nonlinear Robust Filtering of Sampled-Data Dynamical Systems

This work is concerned with robust filtering of nonlinear sampled-data s...
research
11/28/2022

Metric entropy of causal, discrete-time LTI systems

In [1] it is shown that recurrent neural networks (RNNs) can learn - in ...
research
05/01/2021

On the Efficient Implementation of an Implicit Discrete-Time Differentiator

New methodologies are designed to reduce the time complexity of an impli...
research
12/14/2020

Structure-preserving marker-particle discretizations of Coulomb collisions for particle-in-cell codes

This paper contributes new insights into discretizing Coulomb collisions...
research
01/05/2022

Integrability and geometry of the Wynn recurrence

We show that the Wynn recurrence (the missing identity of Frobenius of t...
research
12/11/2020

On some geometric aspects of the class of hv-convex switching components

In the usual aim of discrete tomography, the reconstruction of an unknow...

Please sign up or login with your details

Forgot password? Click here to reset