Arrow Research search
Back to STOC

STOC 1972

The Process Complexity and Effective Random Tests

Conference Paper Accepted Paper Algorithms and Complexity ยท Theoretical Computer Science

Abstract

We propose a variant of the Kolmogorov concept of complexity which yields a common theory of finite and infinite random sequences. The process complexity does not oscillate. We establish some concepts of effective tests which are proved to be equivalent.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
ACM Symposium on Theory of Computing
Archive span
1969-2025
Indexed papers
4364
Paper id
642694308202497482
v2026.09.13