The process complexity and effective random tests.

Authors:
C. P. Schnorr
Affiliations:
-
Venue:
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Year:
1972

Citing 0
Cited 1

Algorithmic complexity of recursive and inductive algorithms

Theoretical Computer Science - Super-recursive algorithms and hypercomputation

Quantified Score

Hi-index	0.00

Visualization

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.