TITLE:
Renormalization of Hierarchy and Semantic Computing
AUTHORS:
Maria K. Koleva
KEYWORDS:
Renormalization, Boundedness, Hierarchy, Decomposition Theorem, Semantic Computing, Markov Process
JOURNAL NAME:
Journal of Modern Physics,
Vol.9 No.3,
February
5,
2018
ABSTRACT: In the setting of boundedness, the renormalization acquires new meaning and implementation: it appears as generic operational protocol available for intelligent complex systems aimed towards essential non-extensive reduction of computation costs and non-extensive speeding up of computing. Another advantage of the proposed above renormalization is that, along with reduction of computation costs and speeding up of computing, it allows further hierarchical super-structuring where the same properties of speeding up the computing and reduction of computation costs hold. The fundamental novelty of that renormalization is provided by a highly non-trivial interplay between structural and functional properties.