On the Length of Programs for Computing Finite Binary Sequences
Journal of the ACM (JACM)
On the Effective Definition of Random Sequence
On the Effective Definition of Random Sequence
Using algorithms as keys in stream ciphers
Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
Machine Learning - Special issue on inductive transfer
On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers
Journal of the ACM (JACM)
Computational Complexity and Probability Constructions
Journal of the ACM (JACM)
An Example of Information and Computation Resource Trade-Off
Journal of the ACM (JACM)
A Theory of Program Size Formally Identical to Information Theory
Journal of the ACM (JACM)
Communications of the ACM
Descriptive complexity of computable sequences
Theoretical Computer Science
Gales and the Constructive Dimension of Individual Sequences
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Sequential Decision Making Based on Direct Search
Sequence Learning - Paradigms, Algorithms, and Applications
The Speed Prior: A New Simplicity Measure Yielding Near-Optimal Computable Predictions
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Advances in evolutionary computing
The dimensions of individual strings and sequences
Information and Computation
ACM SIGACT News
A method for parameter calibration and relevance estimation in evolutionary algorithms
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Large alphabets and incompressibility
Information Processing Letters
ACM Transactions on Programming Languages and Systems (TOPLAS)
An overview of computational complexity
ACM Turing award lectures
Steps to a Cyber-Physical Model of Networked Embodied Anticipatory Behavior
Anticipatory Behavior in Adaptive Learning Systems
Measure software - and its evolution - using information content
Proceedings of the joint international and annual ERCIM workshops on Principles of software evolution (IWPSE) and software evolution (Evol) workshops
Algorithmic information theory
IBM Journal of Research and Development
Descriptive complexity of computable sequences
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Information measures for infinite sequences
Theoretical Computer Science
Preliminary considerations for a quantitative theory of networked embodied intelligence
50 years of artificial intelligence
Studying software evolution using artefacts' shared information content
Science of Computer Programming
A note on blum static complexity measures
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Randomness behaviour in blum universal static complexity spaces
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Turing patterns with Turing machines: emergence and low-level structure formation
Natural Computing: an international journal
Exploring programmable self-assembly in non-DNA based molecular computing
Natural Computing: an international journal
| Hi-index | 0.02 |
An attempt is made to carry out a program (outlined in a previous paper) for defining the concept of a random or patternless, finite binary sequence, and for subsequently defining a random or patternless, infinite binary sequence to be a sequence whose initial segments are all random or patternless finite binary sequences. A definition based on the bounded-transfer Turing machine is given detailed study, but insufficient understanding of this computing machine precludes a complete treatment. A computing machine is introduced which avoids these difficulties.