Author:
Ratsaby Joel,Chaskalovic J.
Publisher
Springer Science and Business Media LLC
Subject
Information Systems,Computer Science (miscellaneous)
Reference20 articles.
1. G. J. Chaitin, A theory of program size formally identical to information theory, Journal of the ACM, 1975, 22(3): 329–340.
2. A. V. Deshmukh, J. Talavage, and M. Barash, Complexity in manufacturing systems, part 1: Analysis of static complexity, IIE Transactions, 1998, 30(7): 645–655.
3. V. V. Vyugin, Algorithmic complexity and stochastic properties of finite binary sequences, The Computer Journal, 1999, 42: 294–317.
4. J. Ratsaby, An algorithmic complexity interpretation of Lin’s third law of information theory, Entropy, 2008, 10(1): 6–14.
5. J. Ratsaby, On the randomness in learning, Proc. of 7th IEEE International Conference on Computational Cybernetics, (ICCC’09), 2009: 141–145.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An empirical study of the complexity and randomness of prediction error sequences;Communications in Nonlinear Science and Numerical Simulation;2011-07
2. On the sysRatio and its critical point;Mathematical and Computer Modelling;2011-03