Skip to main content Accessibility help
×
Home

An incomplete set of shortest descriptions

  • Frank Stephan (a1) and Jason Teutsch (a2)

Abstract

The truth-table degree of the set of shortest programs remains an outstanding problem in recursion theory. We examine two related sets, the set of shortest descriptions and the set of domain-random strings, and show that the truth-table degrees of these sets depend on the underlying acceptable numbering. We achieve some additional properties for the truth-table incomplete versions of these sets, namely retraceability and approximability. We give priority-free constructions of bounded truth-table chains and bounded truth-table antichains inside the truth-table complete degree by identifying an acceptable set of domain-random strings within each degree.

Copyright

References

Hide All
[1]Blum, Manuel, On the size of machines, Information and Control, vol. 11 (1967), pp. 257265.
[2]Calude, Cristian S. and Nies, André, Chaitin Ω numbers and strong reducibilities, Journal of Universal Computer Science, vol. 3 (1997), no. 11, pp. 11621166 (electronic).
[3]Case, John, Homework assignment for students, Computer and Information Sciences Department, University of Delaware, 1990.
[4]Chaitin, Gregory J., A theory of program size formally identical to information theory, Journal of the ACM, vol. 22 (1975), pp. 329340.
[5]Chaitin, Gregory J., Incompleteness theorems for random reals, Advances in Applied Mathematics, vol. 8 ( 1987), no. 2, pp. 119146.
[6]Davie, George, Foundations of mathematics—recursion theory question, http://cs.nyu.edu/pipermail/fom/2002-May/005535.html.
[7]Downey, Rodney G. and Hirschfeldt, Denis R., Algorithmic randomness and complexity, Theory and Applications of Computability, Springer, 2010.
[8]Fenner, Stephen and Schaefer, Marcus, Bounded immunity and btt-reductions, Mathematical Logic Quarterly, vol. 45 (1999), no. 1, pp. 321.
[9]Figueira, Santiago, Stephan, Frank, and Wu, Guohua, Randomness and universal machines, Journal of Complexity, vol. 22 (2006), pp. 738751.
[10]Friedman, Harvey, Foundations of mathematics—recursion theory question, http://cs.nyu.edu/pipermail/fom/2002-February/005289.html.
[11]Griffor, Edward R., Handbook of computability theory, Studies in Logic and Foundations of Mathematics, North-Holland, Amsterdam, 1999.
[12]Jain, Sanjay, Stephan, Frank, and Teutsch, Jason, Index sets and universal numberings, CiE 2009: Proceedings of the 5th conference on Computability in Europe, Springer, 2009, pp. 270279.
[13]Kinber, Efim, On btt-degrees of sets of minimal numbers in Gödel numberings, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 23 (1977), no. 3, pp. 201212.
[14]Kummer, Martin, personal communication.
[15]Kummer, Martin, On the complexity of random strings (extended abstract), STACS '96: Proceedings of the 13th annual Symposium on Theoretical Aspects of Computer Science, Springer, 1996, pp. 2536.
[16]Kummer, Martin and Stephan, Frank, Recursion-theoretic properties of frequency computation and bounded queries, Information and Computation, vol. 120 (1995), no. 1, pp. 5977.
[17]Marandžjan, G. B., On the sets of minimal indices of partial recursive functions, Mathematical Foundations of Computer Science, vol. 74 (1979), pp. 372374.
[18]Marandžjan, G. B., Selected topics in recursive function theory, Technical Report 1990–75, Technical University of Denmark, August 1990.
[19]Martin-Löf, Per, The definition of random sequences, Information and Control, vol. 9 (1966), pp. 602619.
[20]Meyer, Albert R., Program size in restricted programming languages, Information and Control, vol. 21 (1972), pp. 382394.
[21]Odifreddi, Piergiorgio, Classical recursion theory, Studies in Logic and the Foundations of Mathematics, vol. 125, North-Holland, Amsterdam, 1989.
[22]Robinson, Robert W., Interpolation and embedding in the recursively enumerable degrees, Annals of Mathematics (2), vol. 93 (1971), pp. 285314.
[23]Sacks, Gerald E., Recursive enumerability and the jump operator, Transactions of the Amererican Mathematical Society, vol. 108 (1963), pp. 223239.
[24]Sacks, Gerald E., The recursively enumerable degrees are dense, Annals of Mathematics (2), vol. 80 (1964), pp. 300312.
[25]Schaefer, Marcus, A guided tour of minimal indices and shortest descriptions, Archive for Mathematical Logic, vol. 37 (1998), no. 8, pp. 521548.
[26]Schwarz, Steven, Quotient lattices, index sets, and recursive linear orderings, Ph.D. thesis, University of Chicago, 1982.
[27]Soare, Robert I., Recursively enumerable sets and degrees, Perspectives in Mathematical Logic, Springer, 1987.
[28]Stephan, Frank, Degrees of computing and learning, Habilitationsschrift, University of Heidelberg, 1999.
[29]Stephan, Frank, The complexity of the set of nonrandom numbers, Randomness and complexity, from Leibnitz to Chaitin (Calude, Cristian S., editor), World Scientific, 2007, pp. 217230.
[30]Stephan, Frank and Teutsch, Jason, Immunity and hyperimmunity for sets of minimal indices, Notre Dame Journal of Formal Logic, vol. 49 (2008), no. 2, pp. 107125.
[31]Teutsch, Jason, Noncomputable spectral sets, Ph.D. thesis, Indiana University, 2007.
[32]Teutsch, Jason, On the Turing degrees of minimal index sets, Annals of Pure Applied Logic, vol. 148 (2007), no. 1–3, pp. 6380.
[33]Zvonkin, A. K. and Levin, L. 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), no. 6, pp. 83124.

Related content

Powered by UNSILO

An incomplete set of shortest descriptions

  • Frank Stephan (a1) and Jason Teutsch (a2)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.