The process complexity and effective random tests
- 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.
| Author: | Claus Peter SchnorrGND |
|---|---|
| URN: | urn:nbn:de:hebis:30-20812 |
| Parent Title (German): | Proceedings of the fourth annual ACM symposium on theory of computing |
| Publisher: | ACM Pres |
| Document Type: | Conference Proceeding |
| Language: | English |
| Date of Publication (online): | 2005/11/10 |
| Year of first Publication: | 1972 |
| Publishing Institution: | Universitätsbibliothek Johann Christian Senckenberg |
| Release Date: | 2005/11/10 |
| First Page: | 168 |
| Last Page: | 176 |
| Source: | Proceedings of the fourth annual ACM symposium on theory of computing ; Publisher: ACM Press, http://portal.acm.org/ |
| HeBIS-PPN: | 224428233 |
| Institutes: | Informatik und Mathematik / Mathematik |
| Informatik und Mathematik / Informatik | |
| Dewey Decimal Classification: | 5 Naturwissenschaften und Mathematik / 51 Mathematik / 510 Mathematik |
| Licence (German): |  Deutsches Urheberrecht |
