Hostname: page-component-586b7cd67f-rdxmf Total loading time: 0 Render date: 2024-11-25T00:28:40.290Z Has data issue: false hasContentIssue false
  • English
  • Français

Enumerations of the Kolmogorov function

Published online by Cambridge University Press:  12 March 2014

Richard Beigel ,
Harry Buhrman ,
Peter Fejer ,
Lance Fortnow ,
Piotr Grabowski ,
Luc Longpré ,
Andrej Muchnik ,
Frank Stephan  and
Leen Torenvliet
Richard Beigel
Affiliation:
Department of Computer and Information Sciences, Temple University, 1805 North Broad Street, Philadelphia PA 19122, USA. E-mail: [email protected]
Harry Buhrman
Affiliation:
Centrum Voor Wiskunde en Informatica (CWI), Kruislaan 413, 1090 GB Amsterdam, The Netherlands. E-mail: [email protected]
Peter Fejer
Affiliation:
Department of Computer Science, University of Massachusetts Boston, Boston, MA 02125, USA. E-mail: [email protected]
Lance Fortnow
Affiliation:
Department of Computer Science, University of Chicago, 1100 East 58TH Street, Chicago, IL 60637, USA. E-mail: [email protected]
Piotr Grabowski
Affiliation:
Institut für Informatik, Im Neuenheimer Feld 294. 69120 Heidelberg, Germany. E-mail: [email protected]
Luc Longpré
Affiliation:
University of Texasat el Paso, El Paso, TX 79968, USA. E-mail: [email protected]
Andrej Muchnik
Affiliation:
Institute of New Techologies, Nizhnyaya Radishevskaya, 10. Moscow, 109004, Russia. E-mail: [email protected]
Frank Stephan
Affiliation:
School of Computing and Department of Mathematics, National University of Singapore, 3 Science Drive 2, Singapore 117543., Republic of Singapore. E-mail: [email protected]
Leen Torenvliet
Affiliation:
Institute for Language, Logic and Computation, University of Amsterdam, Plantage Muidergracht 24, 1018 TV Amsterdam
Get access Rights & Permissions [Opens in a new window]

Abstract

A recursive enumerator for a function h is an algorithm f which enumerates for an input x finitely many elements including h(x). f is a k(n)-enumerator if for every input x of length n. h(x) is among the first k(n) elements enumerated by f. If there is a k(n)-enumerator for h then h is called k(n)-enumerable. We also consider enumerators which are only A-recursive for some oracle A.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 71 , Issue 2 , June 2006 , pp. 501 - 528
Copyright
Copyright © Association for Symbolic Logic 2006

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Ambainis, Andris, Buhrman, Harry, Gasarch, William. Kalyanasundaram, Bela, and Torenvliet, Leen, The communication complexity of enumeration, elimination and selection. Proceedings 15th IEEE Conference on Computational Complexity. 2000. pp. 44–53.Google Scholar
[2]Amir, Amihood, Beigel, Richard, and Gasarch, William, Some connections between bounded query classes and nonuniform complexity, Proceedings of the 5th Annual Conference on Structure in Complexity Theory, 1990, pp. 232–243.CrossRefGoogle Scholar
[3]Bārzdiṇš, Janis M., Complexity of programs to determine whether natural numbers not greater than n belong to a recursively enumerable set, Soviet Mathematics Doklady, vol. 9 (1968). pp. 1251–1254.Google Scholar
[4]Beigel, Richard, Query-limited redueihilities, Ph.D. thesis, Department of Computer Science, Stanford University, 1987.Google Scholar
[5]Beigel, Richard, Buhrman, Harry, Fejer, Peter A., Fortnow, Lance, Grabowski, Piotr, Longpré, Luc, Muchnik, Andrej A., Stephan, Frank, and Torenvliet, Leen, Enumerations of the Kolmogorov function, Electronic Colloquium on Computational Complexity (ECCC), (015), 2004.Google Scholar
[6]Beigel, Richard, Gasarch, William, Gill, John, and Owings, Jim Jr., Terse, superterse and verbose sets, Information and Computation, vol. 103 (1993), pp. 68–85.CrossRefGoogle Scholar
[7]Buhrman, Harry and Torenvliet, Leen, Randomness is hard, SIAM Journal on Computing, vol. 30 (2000), no. 5, pp. 1485–1501.CrossRefGoogle Scholar
[8]Cai, Jin-Yi, and Hemachandra, Lane, Enumerative counting is hard, Information and Computation. vol. 82 (1989), no. 1, pp. 34–44.CrossRefGoogle Scholar
[9]Cai, Jin-Yi, and Hemachandra, Lane, A note on enumerative counting, Information Processing Letters, vol. 38 (1991), no. 4, pp. 215–219.CrossRefGoogle Scholar
[10]Canetti, Ran, More on BPP and the polynomial-time hierarchy, Information Processing Letters, vol. 57 (1996), no. 5, pp. 237–241.CrossRefGoogle Scholar
[11]Chaitin, Gregory, On the length of programs for computing finite binary sequences. Journal of the Association for Computing Machinery, vol. 13 (1966), pp. 547–569.CrossRefGoogle Scholar
[12]Chaitin, Gregory, Information-theoretical characterizations of recursive infinite strings, Theoretical Computer Science, vol. 2 (1976), pp. 45–48.CrossRefGoogle Scholar
[13]Downey, Rod, Hirschfeldt, Denis, Nies, André, and Stephan, Frank, Trivial reals, Proceedings of the 7th and 8th Asian Logic Conferences (Downey, R.et al., editors). World Scientific, River Edge, 2003. pp. 103–131.CrossRefGoogle Scholar
[14]Friedberg, Richard and Rogers, Hartley, Reducibilities and completeness for sets of integers. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik. vol. 5 (1959). pp. 117–125.CrossRefGoogle Scholar
[15]Gasarch, William, and Stephan, Frank, A techniques oriented survey of bounded queries. Models and computahility: Invited papers from Logic Colloquium 1997 – European Meeting of the Association for Symbolic Logic, Leeds, July 1997 (Cooper, and Truss, , editors), Cambridge University Press, 1999, pp. 117–156.CrossRefGoogle Scholar
[16]Hartmanis, Juris, Generalized Kolmogorov complexity and the structure of feasible computations, Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, 1983. pp. 439–445.Google Scholar
[17]Jockusch, Carl G. Jr. and Shore, Richard, Pseudo-jump operators I:the r. e. case., Transactions of the American Mathematical Society, vol. 275 (1983), pp. 599–609.Google Scholar
[18]Jockusch, Carl G. Jr. and Soare, Robert I.. Π01 classes and degrees of theories, Transactions of the American Mathematical Society, vol. 173 (1972), pp. 33–56.Google Scholar
[19]Kolmogorov, Andrei, Three approaches for defining the concept of information quantity, Problems of Information Transmission, vol. 1 (1965). pp. 1–7.Google Scholar
[20]Kučera, Antonín, and Terwijn, Sebastiaan A., Lowness for the class of random sets, this Journal, (1999), no. 64, pp. 1396–1402.Google Scholar
[21]Kummer, Martin, On the complexity of random strings, Proceedings of the 13th Symposium on Theoretical Aspects of Computer Science (Puech, C. and Reischuk, R., editors), Lecture Notes in Computer Science, vol. 1046, Springer, 1996, pp. 25–36.Google Scholar
[22]Kummer, Martin, and Stephan, Frank, Effective search problems, Mathematical Logic Quarterly, vol. 40 (1994), pp. 224–236.CrossRefGoogle Scholar
[23]Li, Ming and Vitányi, Paul M.B.. An introduction to Kolmogorov complexity audits applications. second ed., Graduate Texts in Computer Science, Springer-Verlag. 1997.CrossRefGoogle Scholar
[24]Lund, Carsten, Fortnow, Lance, Karloff, Howard, and Nisan, Noam. Algebraic methods for interactive proof systems, Journal of the Association for Computing Machinery, vol. 39 (1992), no. 4, pp. 859–868.CrossRefGoogle Scholar
[25]Nies, André, Lowness properties of reals and randomness, Advances in Mathematics, vol. 197 (2005). no. 1. pp. 274–305.CrossRefGoogle Scholar
[26]Papadimitriou, Christos H.. Computational complexity, Addison-Wesley. 1994.Google Scholar
[27]Russel, Alexander and Sundaram, Ravi, Symmetric alternation captures BPP. Computational Complexity, vol. 7 (1998). pp. 152–162.CrossRefGoogle Scholar
[28]Shamir, Adi, IP=PSPACE, Journal of the Association for Computing Machinery, vol. 39 (1992). no. 4, pp. 869–877.CrossRefGoogle Scholar
[29]Solomonoff, Ray, A formal theory of inductive inference, part 1 and part 2, Information and Control, vol. 7 (1964), pp. 1–22, 224–254.CrossRefGoogle Scholar
[30]Solovay, Robert, Draft of a paper on Chaitin's work. Manuscript, 215 pages, IBM Thomas J. Watson Research Center, Yorktown Heights, NY. 1975.Google Scholar
[31]Terwijn, Sebastiaan A. and Zambella, Domenico. Algorithmic randomness and lowness, this Journal, vol. 66 (2001), pp. 1199–1205.Google Scholar
[32]Zambella, Domenico, On sequences with simple initial segments, Technical Report ILLC Technical Report ML 1990-05, University of Amsterdam, 1990.Google Scholar
[33]Zvonkin, Alexander K. and Levin, Leonid A., The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms, Russian Mathematical Surveys, vol. 25 (1970), pp. 83–124.CrossRefGoogle Scholar