How to construct random functions
Journal of the ACM (JACM)
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
Some consequences of the existence of pseudorandom generators
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A New Spectral Test for Nonrandomness and the DES
IEEE Transactions on Software Engineering
Proceedings of the 30th IEEE symposium on Foundations of computer science
On the Length of Programs for Computing Finite Binary Sequences: statistical considerations
Journal of the ACM (JACM)
On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers
Journal of the ACM (JACM)
Random Sets in Subrecursive Hierarchies
Journal of the ACM (JACM)
Computational Complexity and Probability Constructions
Journal of the ACM (JACM)
An Asymptotically Random Tausworthe Sequence
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)
Complex Properties of Grammars
Journal of the ACM (JACM)
An overview of computational complexity
Communications of the ACM
A comparison of two approaches to pseudorandomness
Theoretical Computer Science
Incompleteness, Complexity, Randomness and Beyond
Minds and Machines
MML clustering of multi-state, Poisson, vonMises circular and Gaussian distributions
Statistics and Computing
Algorithmic Information Theory and Cellular Automata Dynamics
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
A Survey of Some Quantitative Approaches to the Notion of Information
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
MML Clustering of Continuous-Valued Data Using Gaussian and t Distributions
AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Gales and the Constructive Dimension of Individual Sequences
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Fast Spectral Tests for Measuring Nonrandomness and the DES
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
A survey of some quantitative approaches to the notion of information
Formal and natural computing
Journal of Mathematical Psychology
An Immunological Approach to Change Detection: Theoretical Results
CSFW '96 Proceedings of the 9th IEEE workshop on Computer Security Foundations
On feasible numbers (Preliminary Version)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Exact and approximate membership testers
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
A complexity theoretic approach to randomness
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Quantum mechanics, mathematics, cognition and action
The dimensions of individual strings and sequences
Information and Computation
Algorithmic complexity of recursive and inductive algorithms
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
A method for parameter calibration and relevance estimation in evolutionary algorithms
Proceedings of the 8th annual conference on Genetic and evolutionary computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Natural halting probabilities, partial randomness, and zeta functions
Information and Computation
Very Simple Chaitin Machines for Concrete AIT
Fundamenta Informaticae
Entropy and algorithmic complexity in quantum information theory
Natural Computing: an international journal
Algorithmic complexity as a criterion of unsolvability
Theoretical Computer Science
The Kolmogorov complexity of infinite words
Theoretical Computer Science
Dynamics of a generic Brownian motion: Recursive aspects
Theoretical Computer Science
Comparing Notions of Computational Entropy
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Theory of computing in computer science education
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1
Algorithmic information theory
IBM Journal of Research and Development
Information-Theoretic Image Reconstruction and Segmentation from Noisy Projections
AI '09 Proceedings of the 22nd Australasian Joint Conference on Advances in Artificial Intelligence
Enhancing MML Clustering Using Context Data with Climate Applications
AI '09 Proceedings of the 22nd Australasian Joint Conference on Advances in Artificial Intelligence
Subrecursive programming languages II on program size
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Biological information as set-based complexity
IEEE Transactions on Information Theory - Special issue on information theory in molecular biology and neuroscience
Causal inference using the algorithmic Markov condition
IEEE Transactions on Information Theory
Information complexity of online problems
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Elements of a network theory of complex adaptive systems
International Journal of Bio-Inspired Computation
On the advice complexity of the k-server problem
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Towards an axiomatic system for Kolmogorov complexity
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
ISBMDA'06 Proceedings of the 7th international conference on Biological and Medical Data Analysis
UPP'04 Proceedings of the 2004 international conference on Unconventional Programming Paradigms
The lempel-ziv complexity of fixed points of morphisms
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
A complexity theory of design intentionality
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
The problem with evolutionary art is ...
EvoCOMNET'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part II
Complexity profiles of DNA sequences using finite-context models
USAB'11 Proceedings of the 7th conference on Workgroup Human-Computer Interaction and Usability Engineering of the Austrian Computer Society: information Quality in e-Health
A note on blum static complexity measures
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Model discrimination using an algorithmic information criterion
Automatica (Journal of IFAC)
Bio-inspired information processing applied to engineering systems
IPCAT'12 Proceedings of the 9th international conference on Information Processing in Cells and Tissues
Impugning Randomness, Convincingly
Studia Logica
Process and truth-table characterisations of randomness
Theoretical Computer Science
On the detection of unknown locally repeating patterns in images
ICIAR'12 Proceedings of the 9th international conference on Image Analysis and Recognition - Volume Part I
Randomness behaviour in blum universal static complexity spaces
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Very Simple Chaitin Machines for Concrete AIT
Fundamenta Informaticae
Computable Approximations of Reals: An Information-Theoretic Analysis
Fundamenta Informaticae
Measuring structural similarity of semistructured data based on information-theoretic approaches
The VLDB Journal — The International Journal on Very Large Data Bases
ProvSec'12 Proceedings of the 6th international conference on Provable Security
On Potential Cognitive Abilities in the Machine Kingdom
Minds and Machines
Replacing Causal Faithfulness with Algorithmic Independence of Conditionals
Minds and Machines
| Hi-index | 0.09 |
The use of Turing machines for calculating finite binary sequences is studied from the point of view of information theory and the theory of recursive functions. Various results are obtained concerning the number of instructions in programs. A modified form of Turing machine is studied from the same point of view. An application to the problem of defining a patternless sequence is proposed in terms of the concepts here developed.