Abstract
We show that the set R of Kolmogorov random strings is truth-table complete. This improves the previously known Turing completeness of R and shows how the halting problem can be encoded into the distribution of random strings rather than using the time complexity of non-random strings. As an application we obtain that Post's simple set is truth-table complete in every Kolmogorov numbering. We also show that the truth-table completeness of R cannot be generalized to size-complexity with respect to arbitrary acceptable numberings. In addition we note that R is not frequency computable.
Preview
Unable to display preview. Download preview PDF.
References
R. Beigel, M. Kummer, F. Stephan. Approximable sets. Information and Computation, 120:304–314, 1995.
H. Buhrman, E. Mayordomo. An excursion to the Kolmogorov random strings. In: Proceedings Structure in Complexity Theory, Tenth Annual Conference, pp. 197–203, 1995.
H. Buhrman, P. Orponen. Random strings make hard instances. In: Proceedings Structure in Complexity Theory, Ninth Annual Conference, pp. 217–222, 1994.
C. Calude. Information and randomness. Springer-Verlag, Berlin, 1994.
G. J. Chaitin. On the number of n-bit strings with maximum complexity. Applied Mathematics and Computation, 59:97–100, 1993.
G. J. Chaitin, A. Arslanov, C. Calude. Program-size complexity computes the halting problem. Bulletin of the EATCS, 57:198–200, 1995.
R. Freivalds, S. Jain. Kolmogorov numberings and minimal identification. In: Proceedings EuroCOLT'95, Lecture Notes in Computer Science, 904:182–195, 1995.
C. G. Jockusch, R. I. Soare. Post's problem and his hypersimple set. In: Journal of Symbolic Logic, 38:446–452, 1973.
S. Kaufmann, M. Kummer. On a quantitative notion of uniformity. In: Proceedings MFCS'95, Lecture Notes in Computer Science, 969:169–178, 1995.
A. N. Kolmogorov. Three approaches to the quantitative definition of information. Problems Inform. Transmission, 1:1–7, 1965.
M. Kummer, F. Stephan. Recursion theoretic properties of frequency computation and bounded queries. Information and Computation, 120:59–77, 1995.
A. H. Lachlan. wtt-complete sets are not necessarily tt-complete. Proc. Amer. Math. Soc., 48:429–434, 1975.
M. Li, P. Vitányi. An Introduction to Kolmogorov Complexity and its Applications. Springer-Verlag, New York, 1993.
N. Lynch. Approximations to the halting problem. Journal of Computer and System Sciences, 9:143–150, 1974.
P. Odifreddi. Classical recursion theory. North-Holland, Amsterdam, 1989.
E. L. Post. Recursively enumerable sets of positive integers and their decision problems. Bull. Amer. Math. Soc., 50:284–316, 1944.
G. F. Rose. An extended notion of computability. In Abstr. Intern. Congr. for Logic, Meth., and Phil. of Science, Stanford, CA, 1960.
C. P. Schnorr. Optimal enumerations and optimal Gödel numberings. Mathematical Systems Theory, 8:182–191, 1974.
R. I. Soare. Recursively enumerable sets and degrees. Springer-Verlag, Berlin, 1987.
P. Vitányi. E-mail to the author. September 15, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kummer, M. (1996). On the complexity of random strings. In: Puech, C., Reischuk, R. (eds) STACS 96. STACS 1996. Lecture Notes in Computer Science, vol 1046. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60922-9_3
Download citation
DOI: https://doi.org/10.1007/3-540-60922-9_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60922-3
Online ISBN: 978-3-540-49723-3
eBook Packages: Springer Book Archive