Resource-bounded measure

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 1998, Pages 236-248

  Lutz, J H ^a  

^a Iowa State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATIONAL COMPLEXITY; DECISION THEORY;

CLASSICAL THEORY; DECISION PROBLEMS; EXPONENTIAL TIME; MONOTONE CONVERGENCE; PROBABILITY MEASURES; RESOURCE-BOUNDED; RESOURCE-BOUNDED MEASURE; THEORETIC STRUCTURES;

C (PROGRAMMING LANGUAGE);

EID: 0001937723     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.1998.694611     Document Type: Conference Paper

References (12)

1. K. Ambos-Spies and E. Mayordomo. Resourcebounded measure and randomness. In A. Sorbi, editor, Complexity, Logic and Recursion Theory, Lecture Notes in Pure and Applied Mathematics, pages 1-47. Marcel Dekker, New York, N.Y., 1997.
2. J. M. Breutzmann and J. H. Lutz. Equivalence of measures of complexity classes. SIAM Journal on Computing. To appear.
3. G. J. Chaitin. A theory of program size formally identical to information theory. Journal of the Association for Computing Machinery, 22:329-340, 1975.
4. S. M. Kautz. Resource-bounded randomness and compressibility with repsect to nonuniform measures. In Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science, pages 197-211. Springer-Verlag, 1997.
5. A. N. Kolmogorov. Grundbegrié der Wahrscheinlichkeitsrechnung. Berlin, 1933. English translation, Chelsea Publishing, New York, 1950.
6. J. H. Lutz. Almost everywhere high nonuniform complexity. Journal of Computer and System Sciences, 44:220-258, 1992.
7. J. H. Lutz. The quantitative structure of exponential time. In L. A. Hemaspaandra and A. L. Selman, editors, Complexity Theory Retrospective II, pages 225-254. Springer-Verlag, Berlin, 1997.
8. H. L. Royden. Real Analysis, third edition. Macmillan Publishing Company, New York, N.Y., 1988.
9. C. P. Schnorr. Klassifikation der Zufallsgesetze nach Komplexität und Ordnung. Z. Wahrscheinlichkeitstheorie verw. Geb., 16:1-21, 1970.
10. C. P. Schnorr. A unified approach to the definition of random sequences. Mathematical Systems Theory, 5:246-258, 1971.
11. C. P. Schnorr. Zufälligkeit und Wahrscheinlichkeit. Lecture Notes in Mathematics, 218, 1971.
12. C. P. Schnorr. Process complexity and effective random tests. Journal of Computer and System Sciences, 7:376-388, 1973.