Some Implications of Interval Approach to Dimension for Network Complexity
Abstract
An interval approach to the concept of dimension is presented. Implications of exponentially growing quasiorthogonal dimension for estimates of network complexity are analysed. Bounds on correlations of computational tasks represented by high-dimensional vectors are derived. Network complexity is analyzed from the point of view od the concentration of measure phenomen.