MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Why Computational Complexity Requires Stricter Martingales
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Gales and the Constructive Dimension of Individual Sequences
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Bias Invariance of Small Upper Spans
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Randomness, Computability, and Density
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Universal Recursively Enumerable Sets of Strings
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
On a definition of random sequences with respect to conditional probability
Information and Computation
Quantitative Aspects of Speed-Up and Gap Phenomena
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Comparing notions of randomness
Theoretical Computer Science
Sequential predictions based on algorithmic complexity
Journal of Computer and System Sciences
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Finite state transducers with intuition
UC'10 Proceedings of the 9th international conference on Unconventional computation
Quantitative aspects of speed-up and gap phenomena
Mathematical Structures in Computer Science
Algorithmic randomness and monotone complexity on product space
Information and Computation
Universal recursively enumerable sets of strings
Theoretical Computer Science
A Chaitin $$\Upomega$$ number based on compressible strings
Natural Computing: an international journal
A note on blum static complexity measures
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
A linearly computable measure of string complexity
Theoretical Computer Science
Process and truth-table characterisations of randomness
Theoretical Computer Science
Multiple usage of random bits in finite automata
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Randomness behaviour in blum universal static complexity spaces
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
A Simple Proof of Miller-Yu Theorem
Fundamenta Informaticae
Initial segment complexities of randomness notions
Information and Computation
| Hi-index | 0.00 |
We propose a variant of the Kolmogorov concept of complexity which yields a common theory of finite and infinite random sequences. Processes are sequential coding schemes such as prefix coding schemes. The process complexity is the minimal length of the description of a sequence in a sequential coding scheme. The process complexity does not oscillate. We establish some concepts of effective tests which are proved to be equivalent.