This paper considers the problem of estimating the power consumption at logic and register transfer levels of design from an information theoretical point of view. In particular, it is demonstrated that the average switching activity in the circuit can be calculated using either entropy or informational energy averages. For control circuits and random logic, the output entropy (informational en...

This paper considers the problem of estimating the power consumption at logic and register transfer levels of design from an information theoretical point of view. In particular, it is demonstrated that the average switching activity in the circuit can be calculated using either entropy or informational energy averages. For control circuits and random logic, the output entropy (informational en...

This article deals with a conscious entity being the building block of conscious systems. Such an informational entity is called informon, with its local and global function. The idea of informon as a conscious unit roots in the property of a sufficient complexity and learning capabilities, realized by different sorts of informational interpretation, formalism, general and metaphysicalistic dec...

Kolmogorov complexity theory is used to tell what the algorithmic informational content of a string is. It is defined as the length of the shortest program that describes the string. We present a programming language that can be used to describe categories, functors, and natural transformations. With this in hand, we define the informational content of these categorical structures as the shorte...

What does the informational complexity of dynamical networked systems tell us about intrinsic mechanisms and functions of these complex systems? Recent complexity measures such as integrated information have sought to operationalize this problem taking a whole-versus-parts perspective, wherein one explicitly computes the amount of information generated by a network as a whole over and above tha...

Niyogi’s book entitled ”The Informational Complexity of Learning” [6] addresses the problem of learning from examples. He considers two distant fields: artificial neural networks and natural language. In both areas he gives a theoretical analysis of informational complexity, i.e. the effects of the size of the leaning set and the number of model parameters on the accuracy of learning depending ...

Dealing with informational assurances we have to consider the full complexity of the information society. In a norrower sense informational assurances comprise informational rights, the related legal and social rules as well as the enforcing technical mechanisms. The right of privacy, understood as informational self-determination, is taken as an important example. Starting from a discussion of...

Most of the statistical social network analysis methods rely on a fixed network structure. Earlier methods of dyadic statistical analysis manage to provide quantification on degrees of mutuality between actors and triadic analysis does a step forward allowing validation of theories of balance and transitivity about specific components of a network. Each of these constitutes a subset of a more g...