TY  - CONF
A1  - Schnorr, Claus Peter
T1  - The process complexity and effective random tests
T2  - Proceedings of the fourth annual ACM symposium on theory of computing
N2  - 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.
Y1  - 2005
UR  - http://publikationen.ub.uni-frankfurt.de/frontdoor/index/index/docId/3328
UR  - https://nbn-resolving.org/urn:nbn:de:hebis:30-20812
SP  - 168
EP  - 176
PB  - ACM Pres
ER  -